The cover time of sparse random graphs
From MaRDI portal
Publication:3419608
DOI10.1002/rsa.20151zbMath1113.05089DBLPjournals/rsa/CooperF07OpenAlexW4249543140WikidataQ57401497 ScholiaQ57401497MaRDI QIDQ3419608
Publication date: 7 February 2007
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20151
Related Items (22)
The power of two choices for random walks ⋮ Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ On Some Combinatorial Properties of Random Intersection Graphs ⋮ Asynchronous rumor spreading on random graphs ⋮ On the Cover Time of the Emerging Giant ⋮ Random walk on sparse random digraphs ⋮ Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs ⋮ Random walks and diffusion on networks ⋮ 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" ⋮ Randomized Rumour Spreading: The Effect of the Network Topology ⋮ Stationary distribution and cover time of sparse directed configuration models ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ Potential distribution on random electrical networks ⋮ The cover time of random geometric graphs ⋮ On the chromatic number of non-sparse random intersection graphs ⋮ Tight bounds for the cover time of multiple random walks ⋮ Selected Combinatorial Properties of Random Intersection Graphs ⋮ On the Cover Time of Dense Graphs ⋮ Expander properties and the cover time of random intersection graphs ⋮ Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
This page was built for publication: The cover time of sparse random graphs
