Do you want to publish a course? Click here

Nonlocal biased random walks and fractional transport on directed networks

64   0   0.0 ( 0 )
 Publication date 2020
  fields Physics
and research's language is English




Ask ChatGPT about the research

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.



rate research

Read More

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.
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.
We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This quantity is particularly important for random search processes and target localization in network topologies. Based on the global mean first passage time of target nodes we derive an estimate for the cumulative distribution function of the cover time based on first passage time statistics. We show that our result can be applied to various model networks, including ErdH{o}s-Renyi and Barabasi-Albert networks, as well as various real-world networks. Our results reveal an intimate link between first passage and cover time statistics in networks in which structurally induced temporal correlations decay quickly and offer a computationally efficient way for estimating cover times in network related applications.
We analyze a random walk strategy on undirected regular networks involving power matrix functions of the type $L^{frac{alpha}{2}}$ where $L$ indicates a `simple Laplacian matrix. We refer such walks to as `Fractional Random Walks with admissible interval $0<alpha leq 2$. We deduce for the Fractional Random Walk probability generating functions (network Greens functions). From these analytical results we establish a generalization of Polyas recurrence theorem for Fractional Random Walks on $d$-dimensional infinite lattices: The Fractional Random Walk is transient for dimensions $d > alpha$ (recurrent for $dleqalpha$) of the lattice. As a consequence for $0<alpha< 1$ the Fractional Random Walk is transient for all lattice dimensions $d=1,2,..$ and in the range $1leqalpha < 2$ for dimensions $dgeq 2$. Finally, for $alpha=2$ Polyas classical recurrence theorem is recovered, namely the walk is transient only for lattice dimensions $dgeq 3$. The generalization of Polyas recurrence theorem remains valid for the class of random walks with Levy flight asymptotics for long-range steps. We also analyze for the Fractional Random Walk mean first passage probabilities, mean first passage times, and global mean first passage times (Kemeny constant). For the infinite 1D lattice (infinite ring) we obtain for the transient regime $0<alpha<1$ closed form expressions for the fractional lattice Greens function matrix containing the escape and ever passage probabilities. The ever passage probabilities fulfill Riesz potential power law decay asymptotic behavior for nodes far from the departure node. The non-locality of the Fractional Random Walk is generated by the non-diagonality of the fractional Laplacian matrix with Levy type heavy tailed inverse power law decay for the probability of long-range moves.
We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target, and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow for a proper choice of highly connected target, is realized under the simple condition that the random walk is transient at the target site, and independently of the small-world, scale free or fractal properties of the network. Last, we put forward that the GMFPT to a specific target is not a representative property of the network, since the target averaged GMFPT satisfies much more restrictive bounds, which forbid any sublinear scaling with the network size.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا