One natural way to model human networks, such as social networks, transportation networks, or the internet, is with random graphs.
This paper summarizes the foundations of random graph theory, developed by Paul Erd¨os and Alfred R´enyi in 1958, and some common
techniques used to analyze random graphs. Three more generalized
random graph models are also explored: the configuration model, the
small-world model, and the preferential attachment model. The similarity of these models to human networks is evaluated based on four
criteria: average path length, degree distribution, clustering coefficient, and static or dynamic nature of the graph.
T. Dietterich, A. Ashenfelter, and Y. Bulatov. ICML '04: Proceedings of the twenty-first international conference on Machine learning, page 28. New York, NY, USA, ACM Press, (2004)
H. Saldana, M. Hoyos, and R. sanchez. Abstract Book of the XXIII IUPAP International Conference on Statistical Physics, Genova, Italy, (9-13 July 2007)
E. Nascimento, F. Moura, and M. Lyra. Abstract Book of the XXIII IUPAP International Conference on Statistical Physics, Genova, Italy, (9-13 July 2007)
S. Heusler, S. Mueller, P. Braun, and F. Haake. Abstract Book of the XXIII IUPAP International Conference on Statistical Physics, Genova, Italy, (9-13 July 2007)