As the concept of graph plays a fundamental role in every aspect of complex networks, in this chapter, we will provide a brief introduction to graph theory with particular focus on models of random graphs for their role of furnishing the simplest and more effective way to exhibit large scale graphs having properties similar to the real life networks (like for instance the world wide web). After recalling basic notation and concepts on graphs, we will consider three different models of random graphs for their crucial role in the analysis and simulation of large scale networks. We will make an attempt to present both rigorous mathematical results and applications examples, without much details, but with precise references to retrieve them. We will restrict our analysis to specific aspects that are of much interest for us and for the purpose of this book, in particular we will analyze the asymptotic behavior of random graphs when the size tends to infinity, in terms of connectivity, existence of giant components, distances, and local topological structure.

Some Introductory Notes on Random Graphs

Ravazzi Chiara
2015

Abstract

As the concept of graph plays a fundamental role in every aspect of complex networks, in this chapter, we will provide a brief introduction to graph theory with particular focus on models of random graphs for their role of furnishing the simplest and more effective way to exhibit large scale graphs having properties similar to the real life networks (like for instance the world wide web). After recalling basic notation and concepts on graphs, we will consider three different models of random graphs for their crucial role in the analysis and simulation of large scale networks. We will make an attempt to present both rigorous mathematical results and applications examples, without much details, but with precise references to retrieve them. We will restrict our analysis to specific aspects that are of much interest for us and for the purpose of this book, in particular we will analyze the asymptotic behavior of random graphs when the size tends to infinity, in terms of connectivity, existence of giant components, distances, and local topological structure.
2015
Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni - IEIIT
978-3-319-16966-8
Random graphs
Probabilistic method
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/337904
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact