The cover time of the giant component of a random graph

DOI10.1002/RSA.20201zbMATH Open1157.05045DBLPjournals/rsa/CooperF08OpenAlexW4238297225WikidataQ57401485 ScholiaQ57401485MaRDI QIDQ3514698FDOQ3514698

Authors: Colin Cooper, Alan Frieze 

Publication date: 21 July 2008

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

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

Recommendations

• On the cover time of the emerging giant
• scientific article; zbMATH DE number 2079333
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
• The evolution of the cover time
• On the Cover Time for Random Walks on Random Graphs

zbMATH Keywords

random graphscover timegiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (28)

• The cover times of random walks on random uniform hypergraphs
• On the cover time of dense graphs
• Title not available (Why is that?)
• Stationary distribution and cover time of random walks on random digraphs
• The evolution of the cover time
• On the meeting of random walks on random DFA
• Title not available (Why is that?)
• Viral processes by random walks on random regular graphs
• On the cover time and mixing time of random geometric graphs
• Random walk on sparse random digraphs
• Stationary distribution and cover time of sparse directed configuration models
• On the cover time of the emerging giant
• Cover time of a random graph with given degree sequence
• Meeting, coalescence and consensus time on random directed graphs
• The Cover Time of Random Digraphs
• Viral processes by random walks on random regular graphs
• Cover times for sequences of reversible Markov chains on random graphs
• Cover and hitting times of hyperbolic random graphs
• The cover time of random geometric graphs
• A spectral characterization for concentration of the cover time
• Analytical results for the distribution of cover times of random walks on random regular graphs
• The cover time of sparse random graphs
• Cover times, blanket times, and majorizing measures
• Vacant sets and vacant nets: component structures induced by a random walk
• Component structure of the vacant set induced by a random walk on a random graph
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
• A probabilistic proof of Cooper \& Frieze's ``First Visit Time Lemma

This page was built for publication: The cover time of the giant component of a random graph

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