Skip to main content

Some Introductory Notes on Random Graphs

  • Chapter

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 2141)

Abstract

In the last decades, the words complexity and networks have constantly increased their presence in the scientific literature and have become popular even in our everyday life. Born in different contexts, nowadays they are often associated to characterize the so-called complex networked systems, that are of outstanding importance in our society and range from natural phenomena to technological models. A common example is the internet network, today accessed by one third of the world population and in continuous expansion. While most of the internet users have no deep insight of its architecture, everyone has an idea of its networked nature and has made experience of its complexity, which affects its use in terms of bottlenecks and communication delays.

Keywords

  • Random Graph
  • Degree Distribution
  • Configuration Model
  • Threshold Function
  • Large Scale Network

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (Canada)
  • Compact, lightweight 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

Learn about institutional subscriptions
Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

References

  1. N. Alon, J. Spencer, The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2nd edn. (Wiley, New York, 2000)

    Google Scholar 

  2. M. Bode, N. Fountoulakis, T. Müuller, On the giant component of random hyperbolic graphs, in Proceedings of the 7th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB’13 (2013), pp. 425–429

    Google Scholar 

  3. B. Bollobás, Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. (Cambridge University Press, Cambridge, 2001)

    Google Scholar 

  4. S. Chatterjee, P. Diaconis, A. Sly, Random graphs with a given degree sequence. Ann. Appl. Probab. 21(4), 1215–1625 (2011)

    CrossRef  MathSciNet  Google Scholar 

  5. R. Durrett, Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics (Cambridge University Press, New York, 2007)

    Google Scholar 

  6. P. Erdős, A. Rényi, On random graphs I. Publ. Math. Debr. 6, 290–297 (1959)

    Google Scholar 

  7. P. Erdős, A. Rényi, On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat ó Int. Közl. 5, 17–61 (1960)

    Google Scholar 

  8. P. Erdős, A. Rényi, On the evolution of random graphs. Bull. Inst. Int. Stat. 38, 343–347 (1961)

    Google Scholar 

  9. P. Erdős, A. Rényi, On the strength of connectedness of a random graph. Acta Math. Acad. Sci. Hung. 12, 261–267 (1961)

    CrossRef  Google Scholar 

  10. M. Franceschetti, R. Meester, Random Networks for Communication: From Statistical Physics to Information Systems (Cambridge University Press, Cambridge, 2007)

    Google Scholar 

  11. G. Ganesan, Size of the giant component in a random geometric graph. Ann. Inst. Henri. Poincare Probab. Stat. 49(4), 1130–1140 (2013)

    CrossRef  MATH  MathSciNet  Google Scholar 

  12. P. Gupta, P.R. Kumar, Critical power for asymptotic connectivity in wireless networks, in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, ed. by W.M. McEneany, G. Yin, Q. Zhang (Birkhauser, Boston, 1998), pp. 547–566

    Google Scholar 

  13. R. Meester, R. Roy, Continuum Percolation (Cambridge University Press, Cambridge, 1996)

    CrossRef  MATH  Google Scholar 

  14. M. Molloy, B. Reed, A critical point for random graphs with a given degree sequence. Random Struct. Algorithm 6(2–3), 161–180 (1995)

    CrossRef  MATH  MathSciNet  Google Scholar 

  15. M.E.J. Newman, The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)

    CrossRef  MATH  MathSciNet  Google Scholar 

  16. M. Penrose, Random Geometric Graphs. Oxford Studies in Probability (Oxford University Press, Oxford, 2003)

    Google Scholar 

  17. P. Santi, D.M. Blough, The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Trans. Mob. Comput. 2(1), 25–39 (2003)

    CrossRef  Google Scholar 

  18. X. Ta, G. Mao, B.D.O. Anderson, On the properties of giant component in wireless multi-hop networks, in IEEE INFOCOM 2009 (2009), pp. 2556–2560

    Google Scholar 

  19. X. Ta, G. Mao, B.D.O. Anderson, On the giant component of wireless multihop networks in the presence of shadowing. IEEE Trans. Veh. Technol. 58(2), 5152–5163 (2009)

    Google Scholar 

  20. R. van der Hofstad, Random Graphs and Complex Networks. Lecture Notes (2013). http://www.win.tue.nl/~rhofstad/NotesRGCN.pdf

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabio Fagnani .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Fagnani, F., Fosson, S.M., Ravazzi, C. (2015). Some Introductory Notes on Random Graphs. In: Fagnani, F., Fosson, S., Ravazzi, C. (eds) Mathematical Foundations of Complex Networked Information Systems. Lecture Notes in Mathematics(), vol 2141. Springer, Cham. https://doi.org/10.1007/978-3-319-16967-5_1

Download citation