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

DOI10.1088/1751-8121/AA5AF3MaRDI QIDQ2979696zbMATH OpenOpenAlexFDO

Authors Ido Tishby, O. Biham, E. Katzav

Publication date 26 April 2017

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.01560

zbMATH Keywords

random walkfirst hitting timedegree distributionrandom networksself-avoiding walkfirst intersection lengthErdős-Rényi networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81)

Abstract: Analytical results for the distribution of first hitting times of random walks on ErdH{o}s-R'enyi 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.

Recommendations

• The distribution of first hitting times of random walks on directed Erdős–Rényi networks
• The distribution of first hitting times of non-backtracking random walks on Erdos-Rényi networks
• Analytical results for the distribution of first hitting times of random walks on random regular graphs
• Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks

Cites work

• scientific article; zbMATH DE number 420915 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• scientific article; zbMATH DE number 1024108 (Why is no real title available?)
• scientific article; zbMATH DE number 775283 (Why is no real title available?)
• scientific article; zbMATH DE number 843241 (Why is no real title available?)
• scientific article; zbMATH DE number 841532 (Why is no real title available?)
• scientific article; zbMATH DE number 3194856 (Why is no real title available?)
• A Guide to First-Passage Processes
• A model of self-avoiding random walks for searching complex networks
• Calculation of the connective constant for self-avoiding walks via the pivot algorithm
• Complex networks. Structure, robustness and function.
• Diffusion and reactions in fractals and disordered systems
• Elements of random walk and diffusion processes
• Failure rate modeling for reliability and risk
• First-passage properties of the Erdos–Renyi random graph
• Kinetic growth walks on complex networks
• Networks. An introduction.
• New lower bounds on the self-avoiding-walk connective constant
• On approximating the longest path in a graph
• On the Number of Self-Avoiding Walks
• On the Number of Self-Avoiding Walks. II
• On the cover time of random walks on graphs
• Random walk and the heat equation
• Random walk: A modern introduction
• Random walks on lattices. II
• Self-avoiding walk enumeration via the lace expansion
• The average number of distinct sites visited by a random walker on random graphs
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks

Cited in

(17)

• Stochastic growth tree networks with an identical fractal dimension: construction and mean hitting time for random walks
• Kemeny's constant and global mean first passage time of random walks on octagonal cell network
• Analytical results for the distribution of first hitting times of random walks on random regular graphs
• Eigentime identities for random walks on a family of treelike networks and polymer networks
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks
• First hitting times of simple random walks on graphs with congestion points
• Mean first passage time of preferential random walks on complex networks with applications
• The distribution of first hitting times of non-backtracking random walks on Erdos-Rényi networks
• Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
• Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
• Analytical results for the distribution of first return times of random walks on random regular graphs
• The distribution of first hitting times of random walks on directed Erdős–Rényi networks
• Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks
• Analytical results for the distribution of cover times of random walks on random regular graphs
• First-passage properties of the Erdos–Renyi random graph
• The interpolation between random walk and self-avoiding walk by avoiding marked sites
• Analytical results for the distribution of first-passage times of random walks on random regular graphs

This page was built for publication: The distribution of first hitting times of randomwalks on Erdős-Rényi networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979696)