The cover time of a biased random walk on a random cubic graph

DOI10.4230/LIPIcs.AofA.2018.16zbMath1482.05317arXiv1801.00760OpenAlexW2963761219MaRDI QIDQ4993538

Tony Johansson, Colin Cooper, Alan M. Frieze

Publication date: 15 June 2021

Full work available at URL: https://arxiv.org/abs/1801.00760

zbMATH Keywords

random walkcover timerandom regular graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)

Related Items (3)

The power of two choices for random walks ⋮ Generalized adjacency and Laplacian spectra of the weighted corona graphs ⋮ The cover time of a biased random walk on a random regular graph of odd degree

Cites Work

• Approximate counting, uniform generation and rapidly mixing Markov chains
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• A proof of alon's second eigenvalue conjecture
• A tight upper bound on the cover time for random walks on graphs
• A tight lower bound on the cover time for random walks on graphs
• Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
• The cover time of a biased random walk on G_n,p
• The Cover Time of Random Regular Graphs
• Greedy Random Walk
• Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk

This page was built for publication: The cover time of a biased random walk on a random cubic graph