Linear cover time is exponentially unlikely

Itai Benjamini; Ori Gurel-Gurevich; Ben Morris

doi:10.1007/s00440-011-0403-2

Linear cover time is exponentially unlikely

Itai Benjamini, Ori Gurel-Gurevich, Ben Morris

Department of Mathematics

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

Abstract

We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. We conjecture that the same holds for any simple graph.

Original language	English
Pages (from-to)	451-461
Number of pages	11
Journal	Probability Theory and Related Fields
Volume	155
Issue number	1-2
DOIs	https://doi.org/10.1007/s00440-011-0403-2
State	Published - Feb 2013

All Science Journal Classification (ASJC) codes

Analysis
Statistics and Probability
Statistics, Probability and Uncertainty

Access to Document

10.1007/s00440-011-0403-2

Cite this

@article{c83a0c89f06445e6832c961f21093acb,

title = "Linear cover time is exponentially unlikely",

abstract = "We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. We conjecture that the same holds for any simple graph.",

author = "Itai Benjamini and Ori Gurel-Gurevich and Ben Morris",

year = "2013",

month = feb,

doi = "10.1007/s00440-011-0403-2",

language = "الإنجليزيّة",

volume = "155",

pages = "451--461",

journal = "Probability Theory and Related Fields",

issn = "0178-8051",

publisher = "Springer New York",

number = "1-2",

}

TY - JOUR

T1 - Linear cover time is exponentially unlikely

AU - Benjamini, Itai

AU - Gurel-Gurevich, Ori

AU - Morris, Ben

PY - 2013/2

Y1 - 2013/2

N2 - We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. We conjecture that the same holds for any simple graph.

AB - We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. We conjecture that the same holds for any simple graph.

UR - http://www.scopus.com/inward/record.url?scp=84872663042&partnerID=8YFLogxK

U2 - 10.1007/s00440-011-0403-2

DO - 10.1007/s00440-011-0403-2

M3 - مقالة

SN - 0178-8051

VL - 155

SP - 451

EP - 461

JO - Probability Theory and Related Fields

JF - Probability Theory and Related Fields

IS - 1-2

ER -

Linear cover time is exponentially unlikely

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this