The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Structure of growing social networks
Abstract
We propose some simple models of the growth of social networks, based on three general principles: (1). meetings take place between pairs of individuals at a rate that is high if a pair has one or more mutual friends and low otherwise; (2). acquaintances between pairs of individuals who rarely meet decay over time; (3). there is an upper limit on the number of friendships an individual can maintain. Using computer simulations, we find that models that incorporate all of these features reproduce many of the features of real social networks, including high levels of clustering or network transitivity and strong community structure in which individuals have more links to others within their community than to individuals from other communities.
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
Emergence 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
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Self-citationDiameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Self-citationMonte Carlo Methods in Statistical Physics
Newman, M. E. J., & Barkema, G. T. (1999) · doi:10.1093/oso/9780198517962.001.0001 · Cited by 3,165
Self-citationClasses of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051 · cited 1×
“Instead the distribution appears to be strongly peaked around a certain mean degree (whose value depends on what definition of acquaintance one adopts) and is not noticeably right-skewed [19,20].”
BackgroundBroder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×
“It is widely believed that the rapid growth of the Web leaves a highly distinctive signature in the resulting network, including such characteristic features as power-law degree distributions [4,5], correlations between degree and age of vertices [6], and correlations between degrees of connected vertices [7,8].”
BackgroundSmall Worlds: The Dynamics of Networks between Order and Randomness
Watts, D. J. (1999) · Princeton University Press eBooks · doi:10.1515/9780691188331 · Cited by 2,105
Clustering and preferential attachment in growing networks
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.025102 · Cited by 2,093
Self-citationHierarchical structure in financial markets
Mantegna, R. N. (1999) · The European Physical Journal B · doi:10.1007/s100510050929 · Cited by 2,069
Renormalization group analysis of the small-world network model
Newman, M. E. J., & Watts, D. J. (1999) · Physics Letters A · doi:10.1016/s0375-9601(99)00757-4 · Cited by 1,448
Self-citationThe web of human sexual contacts
Liljeros, F., Edling, C., Amaral, L. A. N., Stanley, E., & Åberg, Y. (2001) · RePEc: Research Papers in Economics · Cited by 1,389
Random graph models of social networks
Newman, M. E. J., Watts, D. J., & Strogatz, S. H. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582999 · Cited by 1,326
Self-citationThe web of human sexual contacts
Liljeros, F., Edling, C. R., Amaral, L. A. N., Stanley, H. E., & Åberg, Y. (2001) · Nature · doi:10.1038/35082140 · Cited by 1,318
Structure of Growing Networks with Preferential Linking
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4633 · Cited by 1,307
Scaling and percolation in the small-world network model
Newman, M. E. J., & Watts, D. J. (1999) · Physical Review E · doi:10.1103/physreve.60.7332 · Cited by 1,202
Self-citationConnectivity of Growing Random Networks
Krapivsky, P. L., Redner, S., & Leyvraz, F. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4629 · Cited by 1,197
Scott, J. (1988) · Sociology · doi:10.1177/0038038588022001007 · Cited by 1,058
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48686-0_1 · Cited by 1,016
Power-Law Distribution of the World Wide Web
Adamic, L. A., & Huberman, B. A. (2000) · Science · doi:10.1126/science.287.5461.2115a · Cited by 1,015
On the properties of small-world network models
Barrat, A., & Weigt, M. (2000) · The European Physical Journal B · doi:10.1007/s100510050067 · Cited by 888
Inferring Web communities from link topology
Gibson, D., Kleinberg, J., & Raghavan, P. (1998) · Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems links, objects, time and space---structure in hypermedia systems - HYPERTEXT '98 · doi:10.1145/276627.276652 · Cited by 768
Newman, M. E. J. (2000) · Journal of Statistical Physics · doi:10.1023/a:1026485807148 · Cited by 716
Self-citationAre randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
Self-citationMean-Field Solution of the Small-World Network Model
Newman, M. E. J., Moore, C., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.3201 · Cited by 407
Self-citationSmall-World Networks: Evidence for a Crossover Picture
Barthélémy, M., & Amaral, L. A. N. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.3180 · Cited by 306
Scaling behaviour of developing and decaying networks
Dorogovtsev, S. N., & Mendes, J. F. F. (2000) · Europhysics Letters (EPL) · doi:10.1209/epl/i2000-00400-0 · Cited by 250
Diffusion, localization and dispersion relations on “small-world” lattices
Monasson, R. (1999) · The European Physical Journal B · doi:10.1007/s100510051038 · Cited by 204
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Self-citationStatistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
The link‐prediction problem for social networks
Liben‐Nowell, D., & Kleinberg, J. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20591 · Cited by 3,043
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Metadata
- Authors
- Jin, E. M., Girvan, M., & Newman, M. E. J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-09-26
- Volume
- 64
- Issue
- 4
- Pages
- 046132-046132
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2099021783
- Cited by
- 505
- References
- 33
- FWCI
- 8.82
- Type
- journal article
- Language
- en
- Open access
- closed
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.