New Bounds for Edge-Cover by Random Walk

Details New Bounds for Edge-Cover by Random Walk New Bounds for Edge-Cover by Random Walk

2011-09-29

arxiv.org/abs/1109.6619v1

Mathematics

Combinatorics

Scientific paper

We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both bounds are tight and may be applied to graphs with arbitrary edge lengths, with implications for Brownian motion on a finite or infinite network of total edge-length $m$.

Affiliated with

Also associated with

No associations

Rating

New Bounds for Edge-Cover by Random Walk 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 New Bounds for Edge-Cover by Random Walk, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Bounds for Edge-Cover by Random Walk will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-152740