Random graph models of social networks
Top Cited Papers
Open Access
- 19 February 2002
- journal article
- research article
- Published by Proceedings of the National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 99 (suppl_1) , 2566-2572
- https://doi.org/10.1073/pnas.012582999
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.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Clustering and preferential attachment in growing networksPhysical Review E, 2001
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Scientific collaboration networks. I. Network construction and fundamental resultsPhysical Review E, 2001
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- Error and attack tolerance of complex networksNature, 2000
- On power-law relationships of the Internet topologyACM SIGCOMM Computer Communication Review, 1999
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- Interorganizational resource networks: Formal patterns of overlapSocial Science Research, 1978
- EditorialSocial Networks, 1978