Linear Cover Time is Exponentially Unlikely

Details Linear Cover Time is Exponentially Unlikely Linear Cover Time is Exponentially Unlikely

2010-11-13

arxiv.org/abs/1011.3118v1

Mathematics

Probability

11 pages

Scientific paper

We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C, there exists a=a(D,C)>0 such that for any graph G, with n vertices and maximal degree D, the probability that a simple random walk, started anywhere in G, will visit every vertex of G in its first Cn steps is at most exp(-an). We conjecture that the same holds for a=a(C)>0 that does not depend on D, provided that the graph G is simple.

Affiliated with

Also associated with

No associations

Rating

Linear Cover Time is Exponentially Unlikely does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Cover Time is Exponentially Unlikely, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Cover Time is Exponentially Unlikely will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445467