Random graphs
Keyword(s):
An introduction to the mathematics of the Poisson random graph, the simplest model of a random network. The chapter starts with a definition of the model, followed by derivations of basic properties like the mean degree, degree distribution, and clustering coefficient. This is followed with a detailed derivation of the large-scale structural properties of random graphs, including the position of the phase transition at which a giant component appears, the size of the giant component, the average size of the small components, and the expected diameter of the network. The chapter ends with a discussion of some of the shortcomings of the random graph model.
Keyword(s):
2014 ◽
Vol 2014
◽
pp. 1-4
◽
Keyword(s):
2010 ◽
Vol 20
(1)
◽
pp. 131-154
◽
2019 ◽
Vol 29
(1)
◽
pp. 35-61