The cover time of sparse random graphs
From MaRDI portal
Publication:3419608
DOI10.1002/rsa.20151zbMath1113.05089WikidataQ57401497 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
05C80: Random graphs (graph-theoretic aspects)
Related Items
Analytical results for the distribution of cover times of random walks on random regular graphs, On the Cover Time of the Emerging Giant, A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma", On the Cover Time of Dense Graphs, Cover time of a random graph with a degree sequence II: Allowing vertices of degree two, Randomized Rumour Spreading: The Effect of the Network Topology, Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems, The power of two choices for random walks, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, On the meeting of random walks on random DFA, Stationary distribution and cover time of random walks on random digraphs, Potential distribution on random electrical networks, On the chromatic number of non-sparse random intersection graphs, Tight bounds for the cover time of multiple random walks, Expander properties and the cover time of random intersection graphs, Random walks and diffusion on networks, Stationary distribution and cover time of sparse directed configuration models, Asynchronous rumor spreading on random graphs, Random walk on sparse random digraphs, The cover time of random geometric graphs, Selected Combinatorial Properties of Random Intersection Graphs, On Some Combinatorial Properties of Random Intersection Graphs
