Analytical results for the distribution of first return times of random walks on random regular graphs
Ido Tishby, Ofer Biham, Eytan Katzav

TL;DR
This paper analytically characterizes the distribution of first return times for random walks on random regular graphs, distinguishing between retroceding and non-retroceding paths, and compares these with Bethe lattice behavior.
Contribution
It provides a novel analytical framework for the distribution of first return times on RRGs, including the distinction between different return path scenarios and their asymptotic properties.
Findings
First return times follow distinct distributions for retroceding and non-retroceding paths.
On infinite RRGs, random walks are transient with return probability less than one.
Results agree well with computer simulations.
Abstract
We present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of nodes of degree . Starting from a random initial node at time , at each time step an RW hops into a random neighbor of its previous node. We calculate the distribution of first return times to the initial node . We distinguish between first return trajectories in which the RW retrocedes its own steps backwards all the way back to the initial node and those in which the RW returns to via a path that does not retrocede its own steps. In the retroceding scenario, each edge that belongs to the RW trajectory is crossed the same number of times in the forward and backward directions. In the non-retroceding scenario the subgraph that consists of the nodes visited by the RW and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
