The Cover Time of Random Regular Graphs
From MaRDI portal
Recommendations
Cited in
(48)- On the cover time of planar graphs
- On the cover time of random walks on graphs
- The cover time of a biased random walk on a random regular graph of odd degree
- Stationary distribution and cover time of sparse directed configuration models
- Cover times for sequences of reversible Markov chains on random graphs
- Cover time in edge-uniform stochastically-evolving graphs
- Viral processes by random walks on random regular graphs
- On the cover time and mixing time of random geometric graphs
- Random walk on sparse random digraphs
- Optimal cover time for a graph-based coupon collector process
- Cover time of a random graph with given degree sequence
- The cover time of random geometric graphs
- The Cover Time of Cartesian Product Graphs
- Random walks with look-ahead in scale-free random graphs
- Multiple random walks in random regular graphs
- Viral processes by random walks on random regular graphs
- Edge cover time for regular graphs
- The Cover Time of Random Digraphs
- Multiple Random Walks and Interacting Particle Systems
- The cover times of random walks on random uniform hypergraphs
- Stationary distribution and cover time of random walks on random digraphs
- scientific article; zbMATH DE number 2079333 (Why is no real title available?)
- Cover time of a random graph with given degree sequence
- The cover time of random geometric graphs
- Component structure of the vacant set induced by a random walk on a random graph
- The cover time of a biased random walk on a random cubic graph
- The cover time of a biased random walk on a random regular graph of odd degree
- A probabilistic proof of Cooper \& Frieze's ``First Visit Time Lemma
- Analytical results for the distribution of cover times of random walks on random regular graphs
- A random walk perspective on hide-and-seek games
- Analytical results for the distribution of first-passage times of random walks on random regular graphs
- On the cover time of the emerging giant
- On the cover time of dense graphs
- Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
- Memory Efficient Anonymous Graph Exploration
- Automata, Languages and Programming
- Vacant sets and vacant nets: component structures induced by a random walk
- Fast Low-Cost Estimation of Network Properties Using Random Walks
- Analytical results for the distribution of first return times of random walks on random regular graphs
- On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
- Speeding up random walk mixing by starting from a uniform vertex
- On the meeting of random walks on random DFA
- Discordant edges for the voter model on regular random graphs
- Meeting, coalescence and consensus time on random directed graphs
- Analytical results for the distribution of first return times of non-backtracking random walks on configuration model networks
- Random walks on edge coloured random graphs
- The joint distribution of first return times and of the number of distinct sites visited by a 1d random walk before returning to the origin
- The cover time of the preferential attachment graph
This page was built for publication: The Cover Time of Random Regular Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317583)
