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, while 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.
Newman et al. REF describe some novel uniquely solvable models of the structure of social networks based on random graphs with arbitrary degree distributions.
Random Graph Models of Social Networks
Proc. Natl. Acad. Sci. USA
Medicine Computer Science