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

TL;DR
This paper analytically characterizes the distribution of first hitting times for random walks on random regular graphs, distinguishing between backtracking and retracing scenarios, and validates findings with simulations.
Contribution
It provides the first analytical derivation of first hitting time distributions and scenario probabilities for random walks on RRGs, including dense and dilute network regimes.
Findings
Backtracking dominates in dilute networks.
Retracing dominates in dense networks.
Analytical results match simulation data.
Abstract
We present analytical results for the distribution of first hitting times of random walks (RWs) on random regular graphs (RRGs) of degree and a finite size . Starting from a random initial node at time , at each time step an RW hops randomly into one of the neighbors of its previous node. In some of the time steps the RW may hop into a yet-unvisited node while in other time steps it may revisit a node that has already been visited before. The first time at which the RW enters a node that has already been visited before is called the first hitting time or the first intersection length. The first hitting event may take place either by backtracking (BT) to the previous node or by retracing (RET), namely stepping into a node which has been visited two or more time steps earlier. We calculate the tail distribution of first hitting (FH)…
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.
