Global mean first-passage times of random walks on complex networks

Details Global mean first-passage times of random walks on complex networks Global mean first-passage times of random walks on complex networks

2009-09-03

arxiv.org/abs/0909.0657v1

Physics

Condensed Matter

Statistical Mechanics

4 pages, 1 figure

Scientific paper

We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target, and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow for a proper choice of highly connected target, is realized under the simple condition that the random walk is transient at the target site, and independently of the small-world, scale free or fractal properties of the network. Last, we put forward that the GMFPT to a specific target is not a representative property of the network, since the target averaged GMFPT satisfies much more restrictive bounds, which forbid any sublinear scaling with the network size.

Affiliated with

Also associated with

No associations

Rating

Global mean first-passage times of random walks on complex networks 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 Global mean first-passage times of random walks on complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Global mean first-passage times of random walks on complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663941