The Birthday Paradox for non-backtracking walks on regular graphs

Get email updates

Benjamin Dozier

For every fixed d≥3d\ge 3 and every ε>0\varepsilon >0, there is C(d,ε)C(d,\varepsilon ) such that on any simple d-regular graph with n vertices, a uniform non-backtracking walk of length greater than C(d,ε)nC(d,\varepsilon )\sqrt{n} from any starting edge is simple with probability less than ε\varepsilon .

What was already known

Alon and Peres conjectured a bound uniform over graphs with minimum degree at least three. Bencs and collaborators obtain a related bound with an additional logarithmic factor in greater generality and no such factor for fixed-degree expanders.

AI involvement AI-centered

GPT-5.6 Sol Ultra proved the degree-three case and supplied the key plans and excursion-reversal arguments. Dozier generalized the proof to fixed degrees d≥3d\ge 3, worked through corner cases and wrote the manuscript. Codex formalized the resulting theorem.

Importance Notable

The theorem establishes the conjectured square-root collision scale for all regular graphs of each fixed degree at least three.

Technical verification Formal (Lean)

Dozier reports a complete Lean proof of Theorem 1.1. The pinned Solution proves birthday_paradox and the formalization manifest reports the three standard axioms for the checked statement.

Formal checking

Dozier reports a complete Lean proof of Theorem 1.1. The pinned Solution proves birthday_paradox and the formalization manifest reports the three standard axioms for the checked statement.

Checker
Benjamin Dozier, reporting Lean 4 verification
Scope
Dozier reports a complete Lean proof of Theorem 1.1. The pinned Solution proves birthday_paradox and the formalization manifest reports the three standard axioms for the checked statement.
Basis
Reported by the linked checker

Human understanding Explained

Dozier explains the planned-walk encoding, why many deviations return quickly and how reversing excursions forces intersections. He used this argument in the human generalization from degree three.

Correction and publication history