Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Linear cover time is exponentially unlikely

From MaRDI portal
Publication:1939561
Jump to:navigation, search

DOI10.1007/s00440-011-0403-2zbMath1259.05154arXiv1011.3118OpenAlexW2007625773MaRDI QIDQ1939561

Itai Benjamini, Ori Gurel-Gurevich, Ben Morris

Publication date: 4 March 2013

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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


zbMATH Keywords

simple random walkcover time


Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Random walks on graphs (05C81)


Related Items

Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees ⋮ Greedy Random Walk



Cites Work

  • Unnamed Item
  • Threshold limits for cover times
  • A tight lower bound on the cover time for random walks on graphs
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1939561&oldid=14373985"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki