Random Graph Models
When the network properties of a real-world dataset is computed, we cannot determine from these values per se whether or not the results are surprising or expected. To be able to make these comparisons and judgements, we are in need of a null model whose values can be juxtaposed with the values of a real-world network. This juxtaposition helps us decide which properties are unexpected and require close examination, and which do not. One such null model is the random graph model. This chapter describes in detail the Erdös–Rényi random graph model and the Bollobás configuration random graph model along with some other models that can be used to generate random graphs. The properties of these graphs are also explained.
- 1.Ellis, David. 2011. The expansion of random regular graphs, Lecture notes. Lent.Google Scholar
- 2.Milo, Ron, Nadav Kashtan, Shalev Itzkovitz, Mark E.J. Newman, and Uri Alon. 2003. On the uniform generation of random graphs with prescribed degree sequences. arXiv:cond-mat/0312028.
- 3.Newman, Mark E.J., Steven H. Strogatz, and Duncan J. Watts. 2001. Random graphs with arbitrary degree distributions and their applications. Physical Review E 64(2):026118.Google Scholar
- 4.Paul, Erdös, and Rényi Alfréd . 1959. On random graphs, i. Publicationes Mathematicae (Debrecen) 6: 290–297.Google Scholar
- 5.Paul, Erdös, and Rényi Alfréd. 1960. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5: 17–61.Google Scholar