Random Walks on deterministic Scale-Free networks: Exact results

Details Random Walks on deterministic Scale-Free networks: Exact results Random Walks on deterministic Scale-Free networks: Exact results

2009-05-16

arxiv.org/abs/0905.2682v3

Physics

Condensed Matter

Statistical Mechanics

7 pages, 3 figures; accepted for publication in Phys. Rev. E

Scientific paper

We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage phenomena and, in particular, we calculate the probability of first return to the main hub. These results allow to derive the exact analytic expression for the mean time to first reach the main hub, whose leading behavior is given by $\tau \sim V^{1-1/\gamma}$, where $V$ denotes the size of the structure, and the mean is over a set of starting points distributed uniformly over all the other sites of the graph. Interestingly, the process turns out to be particularly efficient. We also discuss the thermodynamic limit of the structure and some local topological properties.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503862