On the Cover Time for Random Walks on Random Graphs

DOI10.1017/S0963548398003538zbMath0916.05063OpenAlexW1980985200MaRDI QIDQ4228203

Johan Jonasson

Publication date: 19 July 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548398003538

zbMATH Keywords

probabilityrandom walkrandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (11)

Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ On the cover time and mixing time of random geometric graphs ⋮ The cover time of the preferential attachment graph ⋮ Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs ⋮ Stationary distribution and cover time of sparse directed configuration models ⋮ Comparison of multiple random walks strategies for searching networks ⋮ Cover times for sequences of reversible Markov chains on random graphs ⋮ Many Random Walks Are Faster Than One ⋮ The hitting and cover times of random walks on finite graphs using local degree information ⋮ Expander properties and the cover time of random intersection graphs ⋮ Gaussian networks generated by random walks

This page was built for publication: On the Cover Time for Random Walks on Random Graphs