Walks on Apollonian networks

Details Walks on Apollonian networks Walks on Apollonian networks

2006-01-17

arxiv.org/abs/cond-mat/0601357v1

Eur. Phys. J. B 51, 549-553 (2006)

Physics

Condensed Matter

Statistical Mechanics

5 pages, 4 figures

Scientific paper

10.1140/epjb/e2006-00257-y

We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first passage time, the average return time, the mean-square displacement, and the network coverage for unrestricted random walk. The diffusions both on DANs and RANs are proved to be sublinear. The search efficiency for walks with various strategies and the influence of the topology of underlying networks on the dynamics of walks are discussed. Contrary to one's intuition, it is shown that the self-avoiding random walk, which has been verified as an optimal strategy for searching on scale-free and small-world networks, is not the best strategy for the DAN in the thermodynamic limit.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-229346