The cover time of the giant component of a random graph
From MaRDI portal
Publication:3514698
DOI10.1002/rsa.20201zbMath1157.05045OpenAlexW4238297225WikidataQ57401485 ScholiaQ57401485MaRDI QIDQ3514698
Publication date: 21 July 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20201
Related Items (22)
Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ Diameter and broadcast time of random geometric graphs in arbitrary dimensions ⋮ On the Cover Time of the Emerging Giant ⋮ Random walk on sparse random digraphs ⋮ The cover times of random walks on random uniform hypergraphs ⋮ Stationary distribution and cover time of random walks on random digraphs ⋮ On the meeting of random walks on random DFA ⋮ A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma" ⋮ Cover times, blanket times, and majorizing measures ⋮ A spectral characterization for concentration of the cover time ⋮ Stationary distribution and cover time of sparse directed configuration models ⋮ Cover time of a random graph with given degree sequence ⋮ The Evolution of the Cover Time ⋮ The cover time of random geometric graphs ⋮ Component structure of the vacant set induced by a random walk on a random graph ⋮ Cover times for sequences of reversible Markov chains on random graphs ⋮ Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk ⋮ Unnamed Item ⋮ 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
Cites Work
This page was built for publication: The cover time of the giant component of a random graph
