title: Random graph models of social networks.
abstract: We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
authors.affiliation: Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA. mark@santafe.edu
authors.forename: M E J
authors.initials: ME
authors.lastname: Newman
authors.forename: D J
authors.initials: DJ
authors.lastname: Watts
authors.forename: S H
authors.initials: SH
authors.lastname: Strogatz
mesh_terms: D006801:Humans; D008954:Models, Biological; D012944:Social Support