On the Cover Time for Random Walks on Random Graphs

DOI10.1017/S0963548398003538MaRDI QIDQ4228203zbMATH OpenOpenAlexFDO

Authors 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 graphrandom walk

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2079333
• The cover time of sparse random graphs
• The cover time of two classes of random graphs
• On the cover time of random walks on graphs
• The cover time of the giant component of a random graph

Cited in

(28)

• 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
• Stationary distribution and cover time of sparse directed configuration models
• Cover times for sequences of reversible Markov chains on random graphs
• Hitting times, commute times, and cover times for random walks on random hypergraphs
• Cover time in edge-uniform stochastically-evolving graphs
• Gaussian networks generated by random walks
• On the cover time and mixing time of random geometric graphs
• The cover time of two classes of random graphs
• Random walks with look-ahead in scale-free random graphs
• The cover time of sparse random graphs
• The cover time of the giant component of a random graph
• The Cover Time of Random Digraphs
• Expected hitting and cover times of random walks on some special graphs
• scientific article; zbMATH DE number 2079333 (Why is no real title available?)
• On the trace of random walks on random graphs
• Comparison of multiple random walks strategies for searching networks
• A tight lower bound on the cover time for random walks on graphs
• The Cover Time of a Random Walk in Affiliation Networks
• Analytical results for the distribution of cover times of random walks on random regular graphs
• On the cover time of the emerging giant
• Many Random Walks Are Faster Than One
• Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
• Convergence of blanket times for sequences of random walks on critical random graphs
• On a cover time problem on a dynamic graph with steps at random times
• Cover and hitting times of hyperbolic random graphs
• Hitting times in the binomial random graph
• The cover time of the preferential attachment graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228203)