The Cover Time of Random Digraphs

DOI10.1007/978-3-540-74208-1_31MaRDI QIDQ3603483zbMATH OpenOpenAlexFDO

Authors Colin Cooper, Alan Frieze

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_31

Mathematics Subject Classification ID

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

Recommendations

• Stationary distribution and cover time of random walks on random digraphs
• scientific article; zbMATH DE number 2079333
• On the Cover Time for Random Walks on Random Graphs
• The cover time of the giant component of a random graph
• The Cover Time of Random Regular Graphs

Cited in

(9)

• Stationary distribution and cover time of random walks on random digraphs
• Random walks on some basic classes of digraphs
• scientific article; zbMATH DE number 2079333 (Why is no real title available?)
• On the cover time and mixing time of random geometric graphs
• Stationary distribution and cover time of sparse directed configuration models
• The cover time of random geometric graphs
• The Cover Time of Cartesian Product Graphs
• The stochastic weighted complexity of a group covering of a digraph
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.

This page was built for publication: The Cover Time of Random Digraphs

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