Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439

DOI10.1002/RSA.20258MaRDI QIDQ3619616zbMATH OpenOpenAlexWikidataFDO

Authors Colin Cooper, Alan Frieze

Publication date 8 April 2009

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20258

zbMATH Keywords

covertimegiant componentrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)

Recommendations

• Correction to: ``Tightness for the cover time of the two dimensional sphere
• Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
• Erratum to: ``High order random walks: beyond spectral gap
• Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs
• Correction to: ``Sandwiching dense random regular graphs between binomial random graphs

Cites work

• The mixing time of the giant component of a random graph

Cited in

(4)

• Erratum to: ``First passage percolation on random graphs with finite mean degrees
• Erratum to: ``High order random walks: beyond spectral gap
• Correction to: ``Tightness for the cover time of the two dimensional sphere
• Stationary distribution and cover time of random walks on random digraphs

This page was built for publication: Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439

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