The Cover Time of Random Regular Graphs
From MaRDI portal
Publication:5317583
DOI10.1137/S0895480103428478zbMath1075.05079WikidataQ57401509 ScholiaQ57401509MaRDI QIDQ5317583
Publication date: 16 September 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items
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, Memory Efficient Anonymous Graph Exploration, The cover time of the preferential attachment graph, The cover time of a biased random walk on a random cubic graph, On the Cover Time of the Emerging Giant, Random walk on sparse random digraphs, The cover times of random walks on random uniform hypergraphs, On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?, Stationary distribution and cover time of random walks on random digraphs, Speeding up random walk mixing by starting from a uniform vertex, On the meeting of random walks on random DFA, A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma", Unnamed Item, 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 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, Fast Low-Cost Estimation of Network Properties Using Random Walks, Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk, Viral Processes by Random Walks on Random Regular Graphs, On the Cover Time of Dense Graphs, Cover time of a random graph with a degree sequence II: Allowing vertices of degree two, Viral processes by random walks on random regular graphs, Analytical results for the distribution of first return times of random walks on random regular graphs
