On the cover time of planar graphs

DOI10.1214/ECP.v5-1022zbMath0949.60083arXivmath/0002034OpenAlexW2017299231MaRDI QIDQ1572753

Oded Schramm, Johan Jonasson

Publication date: 27 July 2000

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0002034

zbMATH Keywords

triangulationcircle packinghitting timeeffective resistancecommute timedifference time

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (9)

On the cover time and mixing time of random geometric graphs ⋮ TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks ⋮ Cover times, blanket times, and majorizing measures ⋮ Static and expanding grid coverage with ant robots: complexity results ⋮ How fast planar maps get swallowed by a peeling process ⋮ Exponential concentration of cover times ⋮ Cover times for sequences of reversible Markov chains on random graphs ⋮ UNIFORM SPANNING FORESTS OF PLANAR GRAPHS ⋮ Many Random Walks Are Faster Than One

This page was built for publication: On the cover time of planar graphs