Skip to main content
Log in

Walks on Apollonian networks

  • Statistical and Nonlinear Physics
  • Published:
The European Physical Journal B - Condensed Matter and Complex Systems Aims and scope Submit manuscript

Abstract.

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 the unrestricted random walk. The diffusions both on DANs and RANs are proved to be sublinear. The effects of the network structure on the dynamics and the search efficiencies of walks with various strategies are also discussed. Contrary to intuition, it is shown that the self-avoiding random walk, which has been verified as an optimal local search strategy in networks, is not the best strategy for the DANs in the large size limit.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Y.-H. Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, ZG., Xu, XJ., Wu, ZX. et al. Walks on Apollonian networks. Eur. Phys. J. B 51, 549–553 (2006). https://doi.org/10.1140/epjb/e2006-00257-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1140/epjb/e2006-00257-y

PACS.

Navigation