The cover time of a biased random walk on a random regular graph of odd degree
From MaRDI portal
Publication:5009541
Recommendations
- The cover time of a biased random walk on a random regular graph of odd degree
- The cover time of a biased random walk on a random cubic graph
- The cover time of a biased random walk on \(G_{n,p}\)
- The Cover Time of Random Regular Graphs
- Random walks which prefer unvisited edges, exploring high girth even degree expanders in linear time
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A proof of alon's second eigenvalue conjecture
- Greedy Random Walk
- Introduction to Random Graphs
- Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time
- The Cover Time of Random Regular Graphs
- Vacant sets and vacant nets: component structures induced by a random walk
Cited in
(10)- The cover time of a biased random walk on a random regular graph of odd degree
- Random walks which prefer unvisited edges, exploring high girth even degree expanders in linear time
- Random walks with the minimum degree local rule have O(n^2) cover time
- Edge cover time for regular graphs
- Random walks with the minimum degree local rule have O(N^2) cover time
- 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 a biased random walk on \(G_{n,p}\)
- The Cover Time of Random Regular Graphs
- The cover time of a biased random walk on a random regular graph of odd degree
This page was built for publication: The cover time of a biased random walk on a random regular graph of odd degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009541)
