The cover time of random geometric graphs

DOI10.1002/rsa.20320zbMath1219.05174WikidataQ57401454 ScholiaQ57401454MaRDI QIDQ2998891

Colin Cooper, Alan M. Frieze

Publication date: 11 May 2011

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

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

zbMATH Keywords

random walk; random geometric graph; cover time; ad-hoc wireless network

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C81: Random walks on graphs

Related Items

Resistance distance distribution in large sparse random graphs, On the Cover Time of the Emerging Giant, On the Cover Time of Dense Graphs, On the treewidth of random geometric graphs and percolated grids, Maker‐breaker games on random geometric graphs, Cover time of a random graph with a degree sequence II: Allowing vertices of degree two, Stationary distribution and cover time of random walks on random digraphs, A geometric Achlioptas process, The acquaintance time of (percolated) random geometric graphs, Cops and Robbers on Geometric Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The cover time of the preferential attachment graph
• Internets in the sky: The capacity of three dimensional wireless networks
• On the cover time and mixing time of random geometric graphs
• The cover time of sparse random graphs
• The cover time of the giant component of a random graph
• The Cover Time of Random Digraphs
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• A tight upper bound on the cover time for random walks on graphs
• Random Geometric Graphs
• A tight lower bound on the cover time for random walks on graphs
• The Cover Time of Random Regular Graphs