Skip to main content

Networks of the Extreme: A Search for the Exceptional

  • Chapter
Extreme Events in Nature and Society

Part of the book series: The Frontiers Collection ((FRONTCOLL))

Summary

In this chapter, after a short survey of recent developments in the theory of complex networks, we discuss a class of random graph models for complex networks where the exceptional and Xevents play a crucial role in the formation of network structures. Indeed, some vertices — the “hubs” — have an extremely high number of connections to other vertices, whereas most vertices have just a few. These networks are generally “scale-free”; in other words, they exhibit architectural and statistical stability as the degree distribution grows. We also relate some extremal properties of the diameters of random graphs to the thresholds of epidemic processes, and we discuss robustness against system damage.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.E.J. Newman: Power laws, Pareto distributions and Zipf’s law, arXiv: condmat/0412004

    Google Scholar 

  2. M. Mitzenmacher: A brief history of generative models for power law and lognormal distributions, Internet Math., I, No. 2, 226–251 (2003)

    MathSciNet  Google Scholar 

  3. P. Bak, C. Tang, K. Wiesenfeld: Self organized criticality: An explanation of 1/f noise, Phys. Rev. Lett., 49, 4 (1987)

    MathSciNet  Google Scholar 

  4. Ph. Blanchard, B. Cessac, T. Krüger: What we can learn about self-organized criticality from dynamical systems theory, J. Stat. Phys. 98, 375–404 (2000)

    Article  MATH  Google Scholar 

  5. B. Cessac, Ph. Blanchard, T. Krüger, J.L. Meunier: Self-organized criticality and thermodynamic formalism, J. Stat. Phys. 115, 1283–1326 (2004)

    Article  MATH  ADS  Google Scholar 

  6. P. Erdös, A. Renyi: On random graphs, Publ. Math. — Debrecen 6, 290–297 (1959)

    MathSciNet  MATH  Google Scholar 

  7. R. Albert, A.-L. Barabási: Statistical mechanics of complex networks, Rev. Mod. Phys., 74, 47 (2002), arXiv:cond-mat/0106096

    Article  ADS  Google Scholar 

  8. A.L. Barabasi: Linked: new science of networks, Perseus, New York (2002)

    Google Scholar 

  9. M.E.J. Newman: Structure and function of complex networks, SIAM Rev. 45, 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. S.N. Borogovtsev, J.F.F. Mendes: Evolution of networks, Adv. Phys. 51, 1079–1187 (2002)

    Article  ADS  Google Scholar 

  11. G. Caldarelli, A. Erzan, A. Vespignani: Application of networks, Eur. Phys. J. B 38, Number 2, March II (2004)

    Google Scholar 

  12. S.N. Dorogovtsev, J.F.F. Mendes: Evolution of networks: from biological nets to the Internet and WWW, Oxford University Press, Oxford (2003)

    MATH  Google Scholar 

  13. S. Bornholdt, H.G. Schuster (eds.): Handbook of graphs and networks. From the genome to the Internet, Wiley, New York (2003)

    MATH  Google Scholar 

  14. R. Pastor-Satorras, A. Vespignani: Evolution and structure of the Internet: a statistical physics approach, Cambridge University Press, Cambridge (2004)

    Book  Google Scholar 

  15. M.E.J. Newman, A.L. Barabasi, D. Watts: The structure and dynamics of networks, Princeton University Press, New York (2003)

    Google Scholar 

  16. R. Albert, A.-L. Barabási: Emergence of scaling in random networks, Science, 286, 509 (1999)

    Article  MathSciNet  Google Scholar 

  17. B. Bollobás, O.M. Riordan: Mathematical results on scale-free random graphs, in; Handbook of graphs and networks, from the genome to the internet, eds. S. Bornholdt, H.G. Schuster, Wiley-VCH, Weinheim (2003)

    Google Scholar 

  18. D.J. de Price: A general theory of bibliometric and other cumulative advantage processes, J. Am. Soc. Inform. Sci. 27, 292–306 (1976)

    Article  Google Scholar 

  19. B. Bollobas: Random graphs, 2nd edn., Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  20. Ph. Blanchard, T. Krüger: The “Cameo principle” and the origin of scalefree graphs in social networks, J. Stat. Phys., 114, 5–6 (2004), arXiv: condmat/0302611

    Article  Google Scholar 

  21. Ph. Blanchard, S. Fortunato, T. Krüger, Importance of extremists for the structure of social networks, Phys. Rev. E71 056114 (2005)

    ADS  Google Scholar 

  22. R. Pastor-Satorras, A. Vespignani: Epidemic spreading in scale-free networks, Phys. Rev. Lett. 86, 3200 (2001)

    Article  ADS  Google Scholar 

  23. D. Volchenkov, L. Volchenkova, Ph. Blanchard: Epidemic spreading in a variety of scale free networks, Phys. Rev. E 66 046137 (2002)

    Article  ADS  Google Scholar 

  24. Ph. Blanchard, C.H. Chang, T. Krüger: Epidemic thresholds on scale-free graphs: the interplay between exponent and preferential choice, Ann. Henri Poincaré Suppl. 2, 957–970 (2003)

    Article  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Center for Frontier Sciences

About this chapter

Cite this chapter

Blanchard, P., Krüger, T. (2006). Networks of the Extreme: A Search for the Exceptional. In: Albeverio, S., Jentsch, V., Kantz, H. (eds) Extreme Events in Nature and Society. The Frontiers Collection. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28611-X_12

Download citation

Publish with us

Policies and ethics