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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N. Alon, J. Spencer, The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2nd edn. (Wiley, New York, 2000)
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
B. Bollobás, Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. (Cambridge University Press, Cambridge, 2001)
S. Chatterjee, P. Diaconis, A. Sly, Random graphs with a given degree sequence. Ann. Appl. Probab. 21(4), 1215–1625 (2011)
R. Durrett, Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics (Cambridge University Press, New York, 2007)
P. Erdős, A. Rényi, On random graphs I. Publ. Math. Debr. 6, 290–297 (1959)
P. Erdős, A. Rényi, On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat ó Int. Közl. 5, 17–61 (1960)
P. Erdős, A. Rényi, On the evolution of random graphs. Bull. Inst. Int. Stat. 38, 343–347 (1961)
P. Erdős, A. Rényi, On the strength of connectedness of a random graph. Acta Math. Acad. Sci. Hung. 12, 261–267 (1961)
M. Franceschetti, R. Meester, Random Networks for Communication: From Statistical Physics to Information Systems (Cambridge University Press, Cambridge, 2007)
G. Ganesan, Size of the giant component in a random geometric graph. Ann. Inst. Henri. Poincare Probab. Stat. 49(4), 1130–1140 (2013)
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
R. Meester, R. Roy, Continuum Percolation (Cambridge University Press, Cambridge, 1996)
M. Molloy, B. Reed, A critical point for random graphs with a given degree sequence. Random Struct. Algorithm 6(2–3), 161–180 (1995)
M.E.J. Newman, The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)
M. Penrose, Random Geometric Graphs. Oxford Studies in Probability (Oxford University Press, Oxford, 2003)
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)
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
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)
R. van der Hofstad, Random Graphs and Complex Networks. Lecture Notes (2013). http://www.win.tue.nl/~rhofstad/NotesRGCN.pdf
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-3-319-16967-5_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16966-8
Online ISBN: 978-3-319-16967-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)