The cover time of two classes of random graphs

MaRDI QIDQ2921765zbMATH OpenFDO

Authors Colin Cooper, Alan Frieze

Publication date 13 October 2014

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)

Recommendations

• Bounds on the cover time
• On the cover time of random walks on graphs
• A tight lower bound on the cover time for random walks on graphs
• The cover time of sparse random graphs
• On the Cover Time for Random Walks on Random Graphs

Cited in

(15)

• The hitting and cover times of random walks on finite graphs using local degree information
• On the time to traverse all edges of a graph
• A bound for the covering time of random walks on graphs
• Collecting coupons on trees, and the cover time of random walks
• On the cover time of planar graphs
• Cover time in edge-uniform stochastically-evolving graphs
• On the cover time and mixing time of random geometric graphs
• The cover time of sparse random graphs
• The cover times of random walks on random uniform hypergraphs
• scientific article; zbMATH DE number 109323 (Why is no real title available?)
• On the Cover Time for Random Walks on Random Graphs
• scientific article; zbMATH DE number 1504576 (Why is no real title available?)
• Random Walks on Regular and Irregular Graphs
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
• The cover time of the preferential attachment graph

This page was built for publication: The cover time of two classes of random graphs

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