Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExtreme events and event size fluctuations in biased random walks on networks
484
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Random walk on discrete lattice models is important to understand various types of transport processes. The extreme events, defined as exceedences of the flux of walkers above a prescribed threshold, have been studied recently in the context of complex networks. This was motivated by the occurrence of rare events such as traffic jams, floods, and power black-outs which take place on networks. In this work, we study extreme events in a generalized random walk model in which the walk is preferentially biased by the network topology. The walkers preferentially choose to hop toward the hubs or small degree nodes. In this setting, we show that extremely large fluctuations in event-sizes are possible on small degree nodes when the walkers are biased toward the hubs. In particular, we obtain the distribution of event-sizes on the network. Further, the probability for the occurrence of extreme events on any node in the network depends on its generalized strength, a measure of the ability of a node to attract walkers. The generalized strength is a function of the degree of the node and that of its nearest neighbors. We obtain analytical and simulation results for the probability of occurrence of extreme events on the nodes of a network using a generalized random walk model. The result reveals that the nodes with a larger value of generalized strength, on average, display lower probability for the occurrence of extreme events compared to the nodes with lower values of generalized strength.
rate research
Read More
We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes with smaller number of links are more prone to extreme events than the ones with larger number of links. We obtain analytical estimates and verify them with numerical simulations. They are shown to be robust even when random walkers follow shortest path on the network. The results suggest a revision of design principles and can be used as an input for designing the nodes of a network so as to smoothly handle an extreme event.
In this paper, we study nonlocal random walk strategies generated with the fractional Laplacian matrix of directed networks. We present a general approach to analyzing these strategies by defining the dynamics as a discrete-time Markovian process with transition probabilities between nodes expressed in terms of powers of the Laplacian matrix. We analyze the elements of the transition matrices and their respective eigenvalues and eigenvectors, the mean first passage times and global times to characterize the random walk strategies. We apply this approach to the study of particular local and nonlocal ergodic random walks on different directed networks; we explore circulant networks, the biased transport on rings and the dynamics on random networks. We study the efficiency of a fractional random walker with bias on these structures. Effects of ergodicity loss which occur when a directed network is not any more strongly connected are also discussed.
Extreme events taking place on networks are not uncommon. We show that it is possible to manipulate the extreme events occurrence probabilities and its distribution over the nodes on scale-free networks by tuning the nodal capacity. This can be used to reduce the number of extreme events occurrences on a network. However monotonic nodal capacity enhancements, beyond a point, do not lead to any substantial reduction in the number of extreme events. We point out the practical implication of this result for network design in the context of reducing extreme events occurrences.
We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies corresponding to the poles of Laplace transformed function and separate the short-term and long-term behavior of the first-passage process. We give a formula of the decay rate $beta$, which is inversely proportional to the characteristic relaxation time $tau$ of the target node. This exact formula for the first-passage probability between two nodes at a given time can be approximately solved in the mean field approximation by estimation of the characteristic relaxation time $tau$. Our theoretical results compare well with numerical simulation on artificial as well as real networks.
We develop rigorous, analytic techniques to study the behaviour of biased random walks on combs. This enables us to calculate exactly the spectral dimension of random comb ensembles for any bias scenario in the teeth or spine. Two specific examples of random comb ensembles are discussed; the random comb with nonzero probability of an infinitely long tooth at each vertex on the spine and the random comb with a power law distribution of tooth lengths. We also analyze transport properties along the spine for these probability measures.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
