The cover time of a biased random walk on a random regular graph of odd degree

DOI10.37236/8327zbMath1450.05080OpenAlexW3093967146MaRDI QIDQ2205123

Tony Johansson

Publication date: 20 October 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8327

zbMATH Keywords

discrete time self-interacting random process on graphs

Mathematics Subject Classification ID

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

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A proof of alon's second eigenvalue conjecture
• The cover time of a biased random walk on a random cubic graph
• Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
• 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 regular graph of odd degree