The distribution of first hitting times of random walks on Erdős-Rényi networks

Abstract

Analytical results for the distribution of first hitting times of random walks on Erdős-Rényi networks are presented. Starting from a random initial node, a random walker hops between adjacent nodes until it hits a node which it has already visited before. At this point, the path terminates. The path length, namely the number of steps, $d$, pursued by the random walker from the initial node up to its termination is called the first hitting time or the first intersection length. Using recursion equations, we obtain analytical results for the tail distribution of the path lengths, $P(d>\ell )$. The results are found to be in excellent agreement with numerical simulations. It is found %turns out that the distribution $P(d>\ell )$ follows a product of an exponential distribution and a Rayleigh distribution. The mean, median and standard deviation of this distribution are also calculated, in terms of the network size and its mean degree. The termination of an RW path may take place either by backtracking to the previous node or by retracing of its path, namely stepping into a node which has been visited two or more time steps earlier. We obtain analytical results for the probabilities, $p_b$ and $p_r$, that the cause of termination will be backtracking or retracing, respectively. It is shown that in dilute networks the dominant termination scenario is backtracking while in dense networks most paths terminate by retracing. We also obtain expressions for the conditional distributions $P(d=\ell |b)$ and $P(d=\ell |r)$, for those paths which are terminated by backtracking or by retracing, respectively. These results provide useful insight into the general problem of survival analysis and the statistics of mortality rates when two or more termination scenarios coexist.

25 pages, 10 figures, accepted to J. Phys. A

References in corpus (9)

• Exploring Complex Networks through Random Walks
• Depletion-Controlled Starvation of a Diffusing Forager
• Analytical results for the distribution of shortest path lengths in random networks
• Distance distribution in configuration model networks
• Universality classes of foraging with resource renewal
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks
• The average number of distinct sites visited by a random walker on random graphs
• Kinetic-growth self-avoiding walks on small-world networks
• Random Walks on Complex Networks

Cited by in corpus (11)

• Analytical results for the distribution of first return times of random walks on random regular graphs
• Revealing the Micro-Structure of the Giant Component in Random Graph Ensembles
• The distribution of shortest path lengths in subcritical Erdős-Rényi networks
• A Unified Approach to Gated Reactions on Networks
• Analytical results for the distribution of cover times of random walks on random regular graphs
• The distribution of first hitting times of random walks on directed Erdős-Rényi networks
• Analytical results for the distribution of first-passage times of random walks on random regular graphs
• Analytical results for the distribution of first hitting times of random walks on random regular graphs
• First return times on sparse random graphs
• The joint distribution of first return times and of the number of distinct sites visited by a 1D random walk before returning to the origin
• Analytical results for the distribution of first return times of non-backtracking random walks on configuration model networks