Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

Spatial growth of real-world networks

Marcus Kaiser*

Claus C. Hilgetag

  • School of Engineering and Science, International University Bremen, Campus Ring 6, 28759 Bremen, Germany

  • School of Engineering and Science, International University Bremen, Campus Ring 6, 28759 Bremen, Germany
  • Department of Health Sciences, Boston University, Boston, Massachusetts 02215, USA

  • *Corresponding author. Electronic address: m.kaiser@iu-bremen.de

Phys. Rev. E 69, 036103 – Published 9 March, 2004

DOI: https://doi.org/10.1103/PhysRevE.69.036103

Abstract

Many real-world networks have properties of small-world networks, with clustered local neighborhoods and low average-shortest path. They may also show a scale-free degree distribution, which can be generated by growth and preferential attachment to highly connected nodes, or hubs. However, many real-world networks consist of multiple, interconnected clusters not normally seen in systems grown by preferential attachment, and there also exist real-world networks with a scale-free degree distribution that do not contain highly connected hubs. We describe spatial-growth mechanisms, not using preferential attachment, that address both aspects.

References (25)

  1. D.J. Watts and S.H. Strogatz, Nature (London) 393, 440 (1998).
  2. C. Hilgetag, G.A.P.C. Burns, M.A. O’Neill, J.W. Scannell, and M.P. Young, Philos. Trans. R. Soc. London, Ser. B 355, 91 (2000).
  3. A.-L. Barabási and R. Albert, Science 286, 509 (1999).
  4. B.A. Huberman and L.A. Adamic, Nature (London) 401, 131 (1999).
  5. G. Caldarelli, A. Capocci, P. De Los Rios, and M.A. Munoz, Phys. Rev. Lett. 89, 258702 (2002).
  6. C. Cherniak, J. Neurosci. 14, 2418 (1994).
  7. B.M. Waxman, IEEE J. Sel. Areas Commun. 6, 1617 (1988).
  8. S.-H. Yook, H. Jeong, and A.-L. Barabási, Proc. Natl. Acad. Sci. U.S.A. 99, 13 382 (2002).
  9. D.J. Watts, Small Worlds (Princeton University Press, Princeton, 1999).
  10. J. Kleinberg, Proceedings of the 32nd ACM Symposium on the Theory of Computing, edited by F. Yao and E. Luks (ACM Press, Portland, OR, 2000), pp. 163–170.
  11. K.T.D. Eames and M.J. Keeling, Proc. Natl. Acad. Sci. U.S.A. 99, 13 330 (2002).
  12. R. Segev, M. Benveniste, Y. Shapira, and E. Ben-Jacob, Phys. Rev. Lett. 90, 168101 (2003).
  13. J. D. Murray, Mathematical Biology (Springer, Heidelberg, 1990).
  14. The data of location nodes and connections were processed from the “Autobahn-Informations-System” (AIS), as accessible under http://www.bast.de (data as of 18 July 2002). Only roads defined as highways were included in the analysis. Multiple highway exits for the same city (e.g., Hagen-West and Hagen-Nord) were merged to one location representing the whole city as a node of the network. Due to the merging process and highways currently under construction, 8% of the nodes were separated from the largest cluster and were excluded from analysis.
  15. H. Jeong, S.P. Mason, A.-L. Barabasi, and Z.N. Oltvai, Nature (London) 411, 41 (2001).
  16. J.W. Scannell, G.A. Burns, C.C. Hilgetag, M.A. O’Neil, and M.P. Young, Cereb. Cortex 9, 277 (1999).
  17. M.P. Young, Philos. Trans. R. Soc. London 252, 13 (1993).
  18. R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, 47 (1993).
  19. H. Jeong, B. Tombor, R. Albert, Z. Oltwal, and A.-L. Barabási, Nature (London) 407, 651 (2000).
  20. E. Ravasz, A.L. Somera, D.A. Mongru, Z.N. Oltvai, and A.-L. Barabási, Science 297, 1551 (2002).
  21. D.J. Watts, P.S. Dodds, and M.E.J. Newman, Science 296, 1302 (2002).
  22. M.E.J. Newman, S.H. Strogatz, and D.J. Watts, Phys. Rev. E 64, 026118 (2001).
  23. P. Szabó, I. Scheuring, T. Czárán, and E. Szathmáry, Nature (London) 420, 340 (2002).
  24. K. Kuida, T.F. Haydar, C.Y. Kuan, Y. Gu, C. Taya, H. Karasuyama, M.S. Su, P. Rakic, and R.A. Flavell, Cell 94, 325 (1998).
  25. S. Valverde, R.F. Cancho, and R.V. Solé, Europhys. Lett. 60, 512 (2002).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation