On the Cover Time of the Emerging Giant

DOI10.1137/21M1441468zbMath1493.05275arXiv1808.09608OpenAlexW2888998914MaRDI QIDQ5093588

Wesley Pegden, Tomasz Tkocz, Alan M. Frieze

Publication date: 28 July 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09608

zbMATH Keywords

random graphcover timeemerging giant

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stationary distribution and cover time of random walks on random digraphs
• Cover times, blanket times, and majorizing measures
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Exponential concentration of cover times
• Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
• Superconcentration and Related Topics
• The Evolution of the Cover Time
• The cover time of random geometric graphs
• Anatomy of a young giant component in the random graph
• The cover time of sparse random graphs
• The cover time of the giant component of a random graph
• A tight upper bound on the cover time for random walks on graphs
• A tight lower bound on the cover time for random walks on graphs
• Diameters in Supercritical Random Graphs Via First Passage Percolation
• A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma"
• Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
• The Cover Time of Random Regular Graphs

This page was built for publication: On the Cover Time of the Emerging Giant