Random Walks on Complex Networks

Details Random Walks on Complex Networks Random Walks on Complex Networks

2003-07-30

arxiv.org/abs/cond-mat/0307719v2

Phys. Rev. Lett. 92, 118701 (2004)

Physics

Condensed Matter

Statistical Mechanics

published version (4 pages, 2 eps figures)

Scientific paper

10.1103/PhysRevLett.92.118701

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination number and a characteristic relaxation time, and show that it determines essentially the MFPT. The centrality of a node determines the relative speed by which a node can receive and spread information over the network in a random process. Numerical simulations of an ensemble of random walkers moving on paradigmatic network models confirm this analytical prediction.

Affiliated with

Also associated with

No associations

Rating

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 Random Walks on Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Walks on Complex Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662620