Cover time of a random graph with given degree sequence

MaRDI QIDQ2959892zbMATH OpenFDO

Authors Colin Cooper, Mohammed Abdullah, Alan Frieze

Publication date 10 February 2017

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0101

zbMATH Keywords

random walksrandom graphscover time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex degrees (05C07) Random walks on graphs (05C81)

Recommendations

• Cover time of a random graph with given degree sequence
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
• On the cover time of dense graphs
• The Cover Time of Random Regular Graphs
• scientific article; zbMATH DE number 2079333

Cited in

(10)

• Speeding up cover time of sparse graphs using local knowledge
• On the cover time of dense graphs
• On the cover time of the emerging giant
• Stationary distribution and cover time of random walks on random digraphs
• The cover time of the preferential attachment graph
• Random Walks on Regular and Irregular Graphs
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
• Cover times for sequences of reversible Markov chains on random graphs
• Stationary distribution and cover time of sparse directed configuration models
• Cover time of a random graph with given degree sequence

This page was built for publication: Cover time of a random graph with given degree sequence

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