Kevin E. Bassler

Dr. Kevin E. Bassler

orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 October 2006 in Physical Review E
Verified
Journal Article
Closed access
PDF file
BDBogdan Danila
Bogdan Danila
YYYong Yu
Yong Yu
JMJohn A. Marsh
John A. Marsh
KBKevin E. Bassler
Kevin E. Bassler
We present a heuristic algorithm for the optimization of transport on complex networks. Previously proposed network transport optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to node congestion. By using the resulting routing, a network can sustain significantly higher traffic without jamming than in the case of shortest path routing.

1 April 2009 in Europhysics Letters
Verified
Journal Article
Closed access
PDF file
YSY. Sun
Y. Sun
BDB. Danila
B. Danila
KJK. Josić
K. Josić
KBKevin E. Bassler
Kevin E. Bassler

17 December 2009 in Physical Review E
Verified
Journal Article
Closed access
PDF file
BDBogdan Danila
Bogdan Danila
YSYudong Sun
Yudong Sun
KBKevin E. Bassler
Kevin E. Bassler
We show that the capacity of a complex network that models a city street grid to support congested traffic can be optimized by using routes that collectively minimize the maximum ratio of betweenness to capacity in any link. Networks with a heterogeneous distribution of link capacities and with a heterogeneous transport load are considered. We find that overall traffic congestion and average travel times can be significantly reduced by a judicious use of slower and smaller capacity links.

19 October 2006 in Physical Review E
Verified
Journal Article
Closed access
PDF file
BDBogdan Danila
Bogdan Danila
YYYong Yu
Yong Yu
SESamuel Earl
Samuel Earl
JMJohn A. Marsh
John A. Marsh
ZTZoltan Toroczkai
Zoltan Toroczkai
KBKevin E. Bassler
Kevin E. Bassler
We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging from random diffusion to rigid congestion-gradient driven flow. Each node can be either source or destination for particles and all nodes have the same routing capacity, which are features of ad hoc wireless networks. It is shown that the transport capacity increases when a small amount of congestion awareness is present in the routing rules, and that it then decreases as the routing rules become too rigid when the flow becomes strictly congestion-gradient driven. Therefore, an optimum value of the congestion awareness exists in the routing rules. It is also shown that, in the limit of a large number of nodes, networks using routing based on local information jam at any nonzero load. Finally, we study the correlation between congestion at node level and a betweenness centrality measure.

17 October 2006 in Physical Review E
Verified
Journal Article
Closed access
PDF file
MLMin Liu
Min Liu
KBKevin E. Bassler
Kevin E. Bassler
The coevolution of network topology and dynamics is studied in an evolutionary Boolean network model that is a simple model of a gene regulatory network. We find that a critical state emerges spontaneously resulting from the interplay between topology and dynamics during the evolution. The final evolved state is shown to be independent of initial conditions. The network appears to be driven to a random Boolean network with uniform in-degree of 2 in the large-network limit. However, for biologically realized network sizes, significant finite-size effects are observed including a broad in-degree distribution and an average in-degree connections between 2 and 3. These results may be important for explaining the properties of gene regulatory networks.

28 April 2017 in Physical Review E
Verified
Journal Article
Open access
PDF file
LCLijian Chen
Lijian Chen
KBKevin E. Bassler
Kevin E. Bassler
JMJoseph L. McCauley
Joseph L. McCauley
Gemunu GunaratneGemunu Gunaratne
Gemunu Gunaratne
The state of a stochastic process evolving over a time t is typically assumed to lie on a normal distribution whose width scales like t12. However, processes in which the probability distribution is not normal and the scaling exponent differs from 12 are known. The search for possible origins of such “anomalous” scaling and approaches to quantify them are the motivations for the work reported here. In processes with stationary increments, where the stochastic process is time-independent, autocorrelations between increments and infinite variance of increments can cause anomalous scaling. These sources have been referred to as the Joseph effect and the Noah effect, respectively. If the increments are nonstationary, then scaling of increments with t can also lead to anomalous scaling, a mechanism we refer to as the Moses effect. Scaling exponents quantifying the three effects are defined and related to the Hurst exponent that characterizes the overall scaling of the stochastic process. Methods of time series analysis that enable accurate independent measurement of each exponent are presented. Simple stochastic processes are used to illustrate each effect. Intraday financial time series data are analyzed, revealing that their anomalous scaling is due only to the Moses effect. In the context of financial market data, we reiterate that the Joseph exponent, not the Hurst exponent, is the appropriate measure to test the efficient market hypothesis.