The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Random graph models of social networks
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Self-citationEmergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Self-citationError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Social Network Analysis: A Handbook.
Pappi, F. U., & Scott, J. (1993) · Contemporary Sociology · doi:10.2307/2075047 · Cited by 5,969
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Cited by
Consumer Perceptions of Price, Quality, and Value: A Means-End Model and Synthesis of Evidence
Zeithaml, V. A. (1988) · Journal of Marketing · doi:10.1177/002224298805200302 · Cited by 18,292
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Self-citationNewman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
Self-citationScientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
Self-citationCharacterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Interfirm Collaboration Networks: The Impact of Large-Scale Network Structure on Firm Innovation
Schilling, M. A., & Phelps, C. C. (2007) · Management Science · doi:10.1287/mnsc.1060.0624 · Cited by 1,551
Watts, D. J. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.30.020404.104342 · Cited by 1,163
Self-citationEfficient Immunization Strategies for Computer Networks and Populations
Cohen, R., Havlin, S., & ben-Avraham, D. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.247901 · Cited by 1,162
Dynamics of Dyads in Social Networks: Assortative, Relational, and Proximity Mechanisms
Rivera, M. T., Soderstrom, S. B., & Uzzi, B. (2010) · Annual Review of Sociology · doi:10.1146/annurev.soc.34.040507.134743 · Cited by 939
Origins of Homophily in an Evolving Social Network
Kossinets, G., & Watts, D. J. (2009) · American Journal of Sociology · doi:10.1086/599247 · Cited by 908
Self-citationA tool for filtering information in complex systems
Tumminello, M., Aste, T., Di Matteo, T., & Mantegna, R. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500298102 · Cited by 901
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
Statistical physics of vaccination
Wang, Z., Bauch, C. T., Bhattacharyya, S., d'Onofrio, A., Manfredi, P., Perc, M., Perra, N., Salathé, M., & Zhao, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.006 · Cited by 872
The emergent properties of a dolphin social network
Lusseau, D. (2003) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rsbl.2003.0057 · Cited by 844
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
Durrett, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546594 · Cited by 780
Structural diversity in social contagion
Ugander, J., Backstrom, L., Marlow, C., & Kleinberg, J. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1116502109 · Cited by 695
Explosive Percolation in Random Networks
Achlioptas, D., D'Souza, R. M., & Spencer, J. (2009) · Science · doi:10.1126/science.1167782 · Cited by 673
Cattani, G., & Ferriani, S. (2008) · Organization Science · doi:10.1287/orsc.1070.0350 · Cited by 659
Small Worlds and Regional Innovation
Fleming, L., King, C., & Juda, A. I. (2007) · Organization Science · doi:10.1287/orsc.1070.0289 · Cited by 659
Basic notions for the analysis of large two-mode networks
Latapy, M., Magnien, C., & Vecchio, N. D. (2008) · Social Networks · doi:10.1016/j.socnet.2007.04.006 · Cited by 617
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
Exact controllability of complex networks
Yuan, Z., Zhao, C., Di, Z., Wang, W.-X., & Lai, Y.-C. (2013) · Nature Communications · doi:10.1038/ncomms3447 · Cited by 565
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
Community Detection and Stochastic Block Models
Abbe, E. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834772 · Cited by 544
Improved community detection in weighted bipartite networks
Beckett, S. J. (2016) · Royal Society Open Science · doi:10.1098/rsos.140536 · Cited by 530
Structure of growing social networks
Jin, E. M., Girvan, M., & Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.046132 · Cited by 505
Self-citationA mixture model for random graphs
Daudin, J.-J., Picard, F., & Robin, S. (2008) · Statistics and Computing · doi:10.1007/s11222-007-9046-7 · Cited by 475
Statistical Models for Social Networks
Snijders, T. A. B. (2011) · Annual Review of Sociology · doi:10.1146/annurev.soc.012809.102709 · Cited by 460
The Epistemic Benefit of Transient Diversity
Zollman, K. J. S. (2010) · Erkenntnis · doi:10.1007/s10670-009-9194-6 · Cited by 460
Topology of correlation-based minimal spanning trees in real and model markets
Bonanno, G., Caldarelli, G., Lillo, F., & Mantegna, R. N. (2003) · Physical Review E · doi:10.1103/physreve.68.046130 · Cited by 453
The complexity and robustness of metro networks
Derrible, S., & Kennedy, C. (2010) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.04.008 · Cited by 438
Controlling edge dynamics in complex networks
Nepusz, T., & Vicsek, T. (2012) · Nature Physics · doi:10.1038/nphys2327 · Cited by 430
Truss decomposition in massive networks
Wang, J., & Cheng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2311906.2311909 · Cited by 423
Networks of equities in financial markets
Bonanno, G., Caldarelli, G., Lillo, F., Miccich�, S., Vandewalle, N., & Mantegna, R. N. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00129-6 · Cited by 403
Adversarial Examples for Graph Data: Deep Insights into Attack and Defense
Wu, H., Wang, C., Tyshetskiy, Y., Docherty, A., Lu, K., & Zhu, L. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/669 · Cited by 391
Infection in Social Networks: Using Network Analysis to Identify High-Risk Individuals
Christley, R. M., Pinchbeck, G. L., Bowers, R. G., Clancy, D., French, N. P., Bennett, R., & Turner, J. (2005) · American Journal of Epidemiology · doi:10.1093/aje/kwi308 · Cited by 389
Small-World Phenomena and the Dynamics of Information
Kleinberg, J. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0060 · Cited by 382
Who Is the Best Connected Scientist?A Study of Scientific Coauthorship Networks
Newman, M. E. J. (2004) · Lecture Notes in Physics · doi:10.1007/978-3-540-44485-5_16 · Cited by 379
Self-citationSIR dynamics in random networks with heterogeneous connectivity
Volz, E. (2008) · Journal of Mathematical Biology · doi:10.1007/s00285-007-0116-4 · Cited by 377
Muller, E., & Peres, R. (2019) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2018.05.003 · Cited by 367
Camacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., Gonzalez-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 329
(2010) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/9781420091502-c15 · Cited by 328
A checklist for maximizing reproducibility of ecological niche models
Feng, X., Park, D. S., Walker, C., Peterson, A. T., Merow, C., & Papeş, M. (2019) · Nature Ecology & Evolution · doi:10.1038/s41559-019-0972-5 · Cited by 323
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
Schank, T., & Wagner, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11427186_54 · Cited by 319
The Communication Structure of Epistemic Communities
Zollman, K. J. S. (2007) · Philosophy of Science · doi:10.1086/525605 · Cited by 316
Competing Through Cooperation: The Organization of Standard Setting in Wireless Telecommunications
Leiponen, A. E. (2008) · Management Science · doi:10.1287/mnsc.1080.0912 · Cited by 305
Reconstruction and estimation in the planted partition model
Mossel, E., Neeman, J., & Sly, A. (2015) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0576-6 · Cited by 301
Event-based social networks: linking the online and offline social worlds
Liu, X., He, Q., Tian, Y., Lee, W.-C., McPherson, J., & Han, J. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339693 · Cited by 299
Cunningham, F. C., Ranmuthugala, G., Plumb, J., Georgiou, A., Westbrook, J. I., & Braithwaite, J. (2012) · BMJ Quality & Safety · doi:10.1136/bmjqs-2011-000187 · Cited by 297
Susceptible–infected–recovered epidemics in dynamic contact networks
Volz, E., & Meyers, L. A. (2007) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2007.1159 · Cited by 286
Bipartite graphs as models of complex networks
Guillaume, J.-L., & Latapy, M. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.047 · Cited by 282
Approximating Clustering Coefficient and Transitivity
Schank, T., & Wagner, D. (2005) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00108 · Cited by 274
Protein Contact Networks: An Emerging Paradigm in Chemistry
Di Paola, L., De Ruvo, M., Paci, P., Santoni, D., & Giuliani, A. (2013) · Chemical Reviews · doi:10.1021/cr3002356 · Cited by 269
Self-organization of collaboration networks
Ramasco, J. J., Dorogovtsev, S. N., & Pastor-Satorras, R. (2004) · Physical Review E · doi:10.1103/physreve.70.036106 · Cited by 266
Cattani, G., Ferriani, S., & Allison, P. D. (2014) · American Sociological Review · doi:10.1177/0003122414520960 · Cited by 255
Bipartite structure of all complex networks
Guillaume, J.-L., & Latapy, M. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.03.007 · Cited by 255
Abbe, E., & Sandon, C. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.47 · Cited by 254
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Dunning, I., Gupta, S., & Silberholz, J. (2018) · INFORMS Journal on Computing · doi:10.1287/ijoc.2017.0798 · Cited by 128
“Fur- ther, we constructed a large number of random instances using graph generators inspired by network science research (Watts and Strogatz 1998, Barabási and Albert 1999, Newman et al. 2001, 2002) that capture many structural properties of biological and social networks.”
MethodLiang, X., Connelly, A., & Calamante, F. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2013.11.013 · Cited by 48
Emergent properties, models, and laws of behavioral similarities within groups of twitter users
Cresci, S., Di Pietro, R., Petrocchi, M., Spognardi, A., & Tesconi, M. (2020) · Computer Communications · doi:10.1016/j.comcom.2019.10.019 · Cited by 40
Quantum–classical transitions in complex networks
Alberto Javarone, M., & Armano, G. (2013) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2013/04/p04019 · Cited by 21
(2017) · doi:10.1109/dsaa.2017.57 · Cited by 21
Metadata
- Authors
- Newman, M. E. J., Watts, D. J., & Strogatz, S. H.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2002-02-19
- Volume
- 99
- Issue
- suppl_1
- Pages
- 2566-2572
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2101267973
- Cited by
- 1,326
- References
- 30
- FWCI
- 16.72
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.