Simple versus nonsimple loops on random regular graphs
From MaRDI portal
Abstract: In this note we solve the ``birthday problem for loops on random regular graphs. Namely, for fixed , we prove that on a random -regular graph with vertices, as approaches infinity, with high probability: (i) almost all primitive non-backtracking loops of length are simple, i.e. do not self-intersect, (ii) almost all primitive non-backtracking loops of length self-intersect.
Recommendations
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A proof of Alon’s second eigenvalue conjecture and related problems
- Cutoff on all Ramanujan graphs
- Cutoff phenomena for random walks on random regular graphs
- scientific article; zbMATH DE number 1495995 (Why is no real title available?)
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- On the minimal diameter of closed hyperbolic surfaces
- On the second eigenvalue and random walks in random d-regular graphs
- Random construction of Riemann surfaces
- The non-backtracking spectrum of the universal cover of a graph
This page was built for publication: Simple versus nonsimple loops on random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199381)