ϟ
DOI: 10.1073/pnas.012582999
¤ OpenAccess: Bronze
This work has “Bronze” OA status. This means it is free to read on the publisher landing page, but without any identifiable license.
Random graph models of social networks
M. E. J. Newman,Duncan J. Watts,Steven H. Strogatz
Bipartite graph
Random graph
Computer science
2002
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.
Loading...
- MLA
- APA
- Chicago
- IEEE
- Harvard
- BibTeX
Cite this:
Generate Citation
“Random graph models of social networks” is a paper by M. E. J. Newman Duncan J. Watts Steven H. Strogatz published in 2002. It has an Open Access status of “bronze”. You can read and download a PDF Full Text of this paper here.