Published November 17, 2026 | Version 3

A birthday bound for non-backtracking walks on graphs of bounded degree ratio

Authors/Creators

  • 1. Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel

Description

Let $G$ be a finite simple graph on $n$ vertices with minimum degree $m\ge3$ and maximum degree $M$, and put $Q=M/(m-1)$. A non-backtracking random walk of length $k$ on $G$, started along any directed edge, is vertex-simple with probability at most $256\,Q(1+Q)\,n/k^2$. Hence the conjecture of Alon and Peres, that a non-backtracking walk of length $C(\varepsilon)\sqrt n$ self-intersects with probability at least $1-\varepsilon$, holds with $C(\varepsilon)$ depending only on $\varepsilon$ and a bound for $M/m$; for regular graphs of degree at least three one may take $C(\varepsilon)=31\varepsilon^{-1/2}$ for every degree. The expected self-intersection time is at most $32\sqrt{Q(1+Q)n}+2$, which removes the logarithmic factor from the bound of Bencs et al.\ for graphs of minimum degree at least three and bounded maximum degree. The proof adapts Dozier's argument for regular graphs: departures are weighted by the inverse branching at their vertex, and the deviating local derangement is resampled.

Files

nonbacktracking-birthday-irregular.pdf

Files (405.1 kB)

Name Size
md5:6c9b61c8c7e8bcd03c1d0dea4e6036bb
405.1 kB Preview Download

Additional details

References

  • N. Alon, I. Benjamini, E. Lubetzky and S. Sodin, Non-backtracking random walks mix faster, Commun. Contemp. Math. 9 (2007), no. 4, 585–603. doi: 10.1142/S0219199707002551.
  • F. Bencs, L. A. Goldberg, M. Jenssen, M. Jerrum, G. Pete, G. Regts and Y. Yin, On the self-intersection time of non-backtracking random walks, preprint, 2026, arXiv:2608.09729.
  • B. Dozier, The birthday paradox for non-backtracking walks on regular graphs, preprint, 2026, arXiv:2608.26321.
  • J. H. Kim, R. Montenegro, Y. Peres and P. Tetali, A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm, Ann. Appl. Probab. 20 (2010), no. 2, 495–521. doi: 10.1214/09-AAP625.
  • E. Lubetzky and Y. Peres, Cutoff on all Ramanujan graphs, Geom. Funct. Anal. 26 (2016), no. 4, 1190–1216. doi: 10.1007/s00039-016-0382-7.
  • Y. Shmalo, Math Brain: public snapshot, code and tests, 2026, https://github.com/yspennstate/math-brain-public.
  • Y. Shmalo, Math Brain: shared, auditable memory for multi-agent mathematical research, October 2026, https://github.com/yspennstate/math-brain-public/tree/main/papers/math-brain-2026-10-24.
  • Y. Shmalo, Brain Framework, public software repository, 2026, https://github.com/yspennstate/brain-framework-public.