Skip to main content

Some New Applications of Network Growth Models

  • Chapter
  • First Online:
Dynamics On and Of Complex Networks
  • 1514 Accesses

The study and analysis of complex networks has in recent times sparked widespread attention from the scientific community [1, 2, 3]. This interest has been spurred partly by researchers recognizing networks as useful representations of real-world complex systems, and also due to the widespread availability of computing resources, enabling them to gather and analyze data on a scale much larger than before. Studies have ranged from large-scale empirical analysis of the World Wide Web, social networks and biological systems, to the development of theoretical models and tools to explore the various properties of these systems [4, 5].

A topic that has garnered significant interest is the subject of growing networks, inspired by real-world examples such as that of the Internet, the World Wide Web and scientific citation networks [6, 7, 8]. The particular case of the World Wide Web has led to what is perhaps the best-known body of work on this topic: the preferential attachment model [9, 10], in which vertices are added to a network with edges that attach to pre-existing vertices with probabilities depending on those vertices’ degrees. When the attachment probability is precisely linear in the degree of the target vertex, the resulting degree sequence has a power-law tail, in the limit of large network size. The appearance of the power-law tail is what first led to the popularity of growth models as a method to describe network evolution, as most real-world networks appear to have degree distributions that are approximately power laws.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, 47 (2002).

    Article  MATH  Google Scholar 

  2. S. N. Dorogovtsev and J. F. F. Mendes, Adv. Phys. 51, 1079 (2002).

    Article  Google Scholar 

  3. M. E. J. Newman, SIAM Review 45, 167 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  4. D. J. Watts and S. H. Strogatz, Nature 393, 440 (1998).

    Article  Google Scholar 

  5. R. J. Williams and N. D. Martinez, Nature 404, 180 (2000).

    Article  Google Scholar 

  6. R. Albert, H. Jeong and A.-L. Barabási, Nature 401, 130 (1999).

    Article  Google Scholar 

  7. D. J. de S. Price, Science 149, 510 (1965).

    Article  Google Scholar 

  8. S. Redner, Eur. Phys. J. B 4, 131 (1998).

    Article  Google Scholar 

  9. D. J. de S. Price, J. Amer. Soc. Inform. Sci. 27, 292 (1976).

    Article  Google Scholar 

  10. A.-L. Barabási and R. Albert, Science 286, 509 (1999).

    Article  MathSciNet  Google Scholar 

  11. E. Ben-Naim and P. L. Krapivsky, J. Phys. A: Math. Theor. 40, 8607 (2007).

    Article  MATH  MathSciNet  Google Scholar 

  12. C. Moore, G. Ghoshal and M. E. J. Newman, Phys. Rev. E 74, 036121 (2006).

    Article  MathSciNet  Google Scholar 

  13. J. Saldaña, Phys. Rev. E 75, 027102 (2007).

    Article  MathSciNet  Google Scholar 

  14. T. Hong, in Peer-to-Peer, Harnessing the Benefits of a Disruptive Technology, edited by Andy Oram (O'Reilly, Sebastopol, CA, 2001), Chap. 14, pp. 203–241.

    Google Scholar 

  15. L. A. Adamic, R. M. Lukose, A. R. Puniyani and B. A. Huberman, Phys. Rev. E 64, 046135 (2001).

    Article  Google Scholar 

  16. N. Sarshar, P. O. Boykin and V. P. Roychowdhury, Fourth International Conference on Peer-to-Peer Computing, pp. 2–9, Washington, D.C. (2004).

    Google Scholar 

  17. G. Paul, T. Tanizawa, S. Havlin and H. E. Stanley, Eur. Phys. J. B 38, 187 (2004).

    Article  Google Scholar 

  18. R. Cohen, K. Erez, D. ben-Avraham and S. Havlin, Phys. Rev. Letts. 85, 4626 (2000).

    Article  Google Scholar 

  19. D. S. Callaway, M. E. J. Newman, S. H. Strogatz and D. J. Watts, Phys. Rev. Letts. 85, 5468 (2000).

    Article  Google Scholar 

  20. M. E. J. Newman and G. Ghoshal, Phys. Rev. Letts. 100, 138701 (2008).

    Article  Google Scholar 

  21. B. Rezai, N. Sarshar, V. Roychowdhury and P. Oscar Boykin, Physica A 381, 497 (2007).

    Article  Google Scholar 

  22. A. E. Motter, Phys. Rev. Letts. 93, 098701 (2004).

    Article  Google Scholar 

  23. P. L. Krapivsky and S. Render, Phys. Rev. E 63, 066123 (2001).

    Article  Google Scholar 

  24. G. Ghoshal and M. E. J. Newman, Eur. Phys. J. B, 58, 175 (2007).

    Article  Google Scholar 

  25. M. Molloy and B. Reed, Random Struct. Algorithms 6, 161 (1995).

    Article  MATH  MathSciNet  Google Scholar 

  26. B. Karrer and G. Ghoshal, Eur. Phys. J B, 62, 239 (2008).

    Article  Google Scholar 

  27. J. S. Kong and V. P. Roychowdhury, e-print arXiv:0711.3263v2.

    Google Scholar 

Download references

Acknowledgements

The author thanks Mark Newman and Brian Karrer for illuminating discussions. This work was funded by the James S. McDonnell Foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gourab Ghoshal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Ghoshal, G. (2009). Some New Applications of Network Growth Models. In: Ganguly, N., Deutsch, A., Mukherjee, A. (eds) Dynamics On and Of Complex Networks. Modeling and Simulation in Science, Engineering and Technology. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4751-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-0-8176-4751-3_13

  • Published:

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-0-8176-4750-6

  • Online ISBN: 978-0-8176-4751-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics