The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Clustering and preferential attachment in growing networks
Open accessAbstract
We study empirically the time evolution of scientific collaboration networks in physics and biology. In these networks, two scientists are considered connected if they have coauthored one or more papers together. We show that the probability of a pair of scientists collaborating increases with the number of other collaborators they have in common, and that the probability of a particular scientist acquiring new collaborators increases with the number of his or her past collaborators. These results provide experimental evidence in favor of previously conjectured mechanisms for clustering and power-law degree distributions in networks.
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
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
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
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
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-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×
“We show that the probability of scientists collaborating increases with the number of other collaborators they have in common, and that the probability of a particular scientist acquiring new collaborators increases with the number of his or her past collaborators.”
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×
“We show that the probability of scientists collaborating increases with the number of other collaborators they have in common, and that the probability of a particular scientist acquiring new collaborators increases with the number of his or her past collaborators.”
BackgroundScientific 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-citation
Cited by
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Self-citationDorogovtsev, 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
Link prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
Searching for intellectual turning points: progressive knowledge domain visualization
Chen, C. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307513100 · Cited by 2,791
Scientific 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-citationNewman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Self-citationCoauthorship networks and patterns of scientific collaboration
Newman, M. E. J. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307545100 · Cited by 1,931
Self-citationThe link prediction problem for social networks
Liben-Nowell, D., & Kleinberg, J. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956972 · Cited by 1,612
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-citationSocial network analysis for routing in disconnected delay-tolerant MANETs
Daly, E. M., & Haahr, M. (2007) · Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1288107.1288113 · Cited by 1,151
Growing scale-free networks with tunable clustering
Holme, P., & Kim, B. J. (2002) · Physical Review E · doi:10.1103/physreve.65.026107 · Cited by 1,088
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
Overlapping community detection in networks: The state-of-the-art and comparative study
Xie, J., Kelley, S., & Szymanski, B. K. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501657 · Cited by 930
Overlapping Community Detection in Networks: the State of the Art and Comparative Study
Xie, J., Kelley, S., & Szymanski, B. K. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.5813 · Cited by 865
Durrett, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546594 · Cited by 780
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
A Survey of Link Prediction in Complex Networks
Martínez, V., Berzal, F., & Cubero, J.-C. (2017) · ACM Computing Surveys · doi:10.1145/3012704 · Cited by 695
Similarity index based on local paths for link prediction of complex networks
Lü, L., Jin, C.-H., & Zhou, T. (2009) · Physical Review E · doi:10.1103/physreve.80.046122 · Cited by 678
Modeling bursts and heavy tails in human dynamics
Vázquez, A., Oliveira, J. G., Dezsö, Z., Goh, K.-I., Kondor, I., & Barabási, A.-L. (2006) · Physical Review E · doi:10.1103/physreve.73.036127 · Cited by 673
New perspectives and methods in link prediction
Lichtenwalter, R. N., Lussier, J. T., & Chawla, N. V. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835837 · Cited by 664
Measuring preferential attachment in evolving networks
Jeong, H., Néda, Z., & Barabási, A. L. (2003) · Europhysics Letters (EPL) · doi:10.1209/epl/i2003-00166-9 · Cited by 588
A Survey of Link Prediction in Social Networks
Hasan, M. A., & Zaki, M. J. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_9 · Cited by 566
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
Link prediction in social networks: the state-of-the-art
Wang, P., Xu, B., Wu, Y., & Zhou, X. (2015) · Science China Information Sciences · doi:10.1007/s11432-014-5237-y · Cited by 548
Link prediction techniques, applications, and performance: A survey
Kumar, A., Singh, S. S., Singh, K., & Biswas, B. (2020) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124289 · Cited by 516
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-citationDall, J., & Christensen, M. (2002) · Physical Review E · doi:10.1103/physreve.66.016121 · Cited by 480
Mining Heterogeneous Information Networks: Principles and Methodologies
Sun, Y., & Han, J. (2012) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00433ed1v01y201207dmk005 · Cited by 471
Informetrics at the beginning of the 21st century—A review
Bar-Ilan, J. (2008) · Journal of Informetrics · doi:10.1016/j.joi.2007.11.001 · Cited by 466
The Matthew effect in empirical data
Perc, M. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0378 · Cited by 456
Co-author Relationship Prediction in Heterogeneous Bibliographic Networks
Sun, Y., Barber, R., Gupta, M., Aggarwal, C. C., & Han, J. (2011) · 2011 International Conference on Advances in Social Networks Analysis and Mining · doi:10.1109/asonam.2011.112 · Cited by 445
Friendship prediction and homophily in social media
Aiello, L. M., Barrat, A., Schifanella, R., Cattuto, C., Markines, B., & Menczer, F. (2012) · ACM Transactions on the Web · doi:10.1145/2180861.2180866 · Cited by 441
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
Daly, E. M., & Haahr, M. (2009) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2008.161 · Cited by 426
Social network analysis: An overview
Tabassum, S., Pereira, F. S. F., Fernandes, S., & Gama, J. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1256 · Cited by 419
Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network
Kondor, D., Pósfai, M., Csabai, I., & Vattay, G. (2014) · PLoS ONE · doi:10.1371/journal.pone.0086197 · Cited by 416
Growth of the flickr social network
Mislove, A., Koppula, H. S., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2008) · Proceedings of the first workshop on Online social networks · doi:10.1145/1397735.1397742 · Cited by 413
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
Abbasi, A., Hossain, L., & Leydesdorff, L. (2012) · Journal of Informetrics · doi:10.1016/j.joi.2012.01.002 · Cited by 404
Cannistraci, C. V., Alanis-Lobato, G., & Ravasi, T. (2013) · Scientific Reports · doi:10.1038/srep01613 · Cited by 401
Assessing experimentally derived interactions in a small world
Goldberg, D. S., & Roth, F. P. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0735871100 · Cited by 400
Highly clustered scale-free networks
Klemm, K., & Eguíluz, V. M. (2002) · Physical Review E · doi:10.1103/physreve.65.036123 · Cited by 395
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-citationComplex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
Fitness-Dependent Topological Properties of the World Trade Web
Garlaschelli, D., & Loffredo, M. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.188701 · Cited by 368
Unification of theoretical approaches for epidemic spreading on complex networks
Wang, W., Tang, M., Eugene Stanley, H., & Braunstein, L. A. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa5398 · Cited by 366
Coordination in Rapidly Evolving Disaster Response Systems: The Role of Information
Comfort, L. K., Ko, K., & Zagorecki, A. (2004) · American Behavioral Scientist · doi:10.1177/0002764204268987 · Cited by 359
Inferring anchor links across multiple heterogeneous social networks
Kong, X., Zhang, J., & Yu, P. S. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505531 · Cited by 356
From "think like a vertex" to "think like a graph"
Tian, Y., Balmin, A., Corsten, S. A., Tatikonda, S., & McPherson, J. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2732232.2732238 · Cited by 352
Cho, J.-H., Chan, K., & Adali, S. (2015) · ACM Computing Surveys · doi:10.1145/2815595 · Cited by 342
Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia
Capocci, A., Servedio, V. D. P., Colaiori, F., Buriol, L. S., Donato, D., Leonardi, S., & Caldarelli, G. (2006) · Physical Review E · doi:10.1103/physreve.74.036116 · Cited by 324
Local Probabilistic Models for Link Prediction
Wang, C., Satuluri, V., & Parthasarathy, S. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.108 · Cited by 314
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Asur, S., Parthasarathy, S., & Ucar, D. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1631162.1631164 · Cited by 291
Inferring social ties across heterogenous networks
Tang, J., Lou, T., & Kleinberg, J. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124382 · Cited by 289
“Various similarity measures of users are considered, such as the Adamic and Adar measure [1], the preferential attachment [25], and the Katz measure [16].”
MethodEvaluating link prediction methods
Yang, Y., Lichtenwalter, R. N., & Chawla, N. V. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-014-0789-0 · Cited by 287
Coevolution spreading in complex networks
Wang, W., Liu, Q.-H., Liang, J., Hu, Y., & Zhou, T. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.07.001 · Cited by 286
Cowan, N. J., Chastain, E. J., Vilhena, D. A., Freudenberg, J. S., & Bergstrom, C. T. (2012) · PLoS ONE · doi:10.1371/journal.pone.0038398 · Cited by 273
The structure and function of networks
Newman, M. E. J. (2002) · Computer Physics Communications · doi:10.1016/s0010-4655(02)00201-1 · Cited by 269
Self-citationCharacterizing and Modeling the Dynamics of Activity and Popularity
Zhang, P., Li, M., Gao, L., Fan, Y., & Di, Z. (2014) · PLoS ONE · doi:10.1371/journal.pone.0089192 · Cited by 269
Power laws and self-organized criticality in theory and nature
Marković, D., & Gros, C. (2014) · Physics Reports · doi:10.1016/j.physrep.2013.11.002 · Cited by 263
Principles of scientific research team formation and evolution
Milojević, S. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1309723111 · Cited by 257
Small Worlds and Semantic Network Growth in Typical and Late Talkers
Beckage, N., Smith, L., & Hills, T. (2011) · PLoS ONE · doi:10.1371/journal.pone.0019348 · Cited by 256
Ravindran, K., Susarla, A., Mani, D., & Gurbaxani, V. (2015) · Information Systems Research · doi:10.1287/isre.2015.0572 · Cited by 68
Li, Z. (., Fang, X., & Sheng, O. R. L. (2018) · ACM Transactions on Management Information Systems · doi:10.1145/3131782 · Cited by 65
A Quantitative Exploration on Reasons for Citing Articles from the Perspective of Cited Authors
Wang, B., Bu, Y., & Xu, Y. (2018) · Scientometrics · doi:10.1007/s11192-018-2787-6 · Cited by 19
Preferential Attachment in Online Networks: Measurement and Explanations
Kunegis, J., Blattner, M., & Moser, C. (2013) · arXiv · doi:10.48550/arxiv.1303.6271 · Cited by 14
Attention Inequality in Social Media
Zhu, L., & Lerman, K. (2016) · arXiv · doi:10.48550/arxiv.1601.07200 · Cited by 13
“The Nearest Neighbor Model (Newman 2001) was proposed based on the observation that the probability of two unacquainted users to become friends increases with the (weighted) number of common friends.”
Background
Metadata
- Authors
- Newman, M. E. J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-07-26
- Volume
- 64
- Issue
- 2
- Pages
- 025102-025102
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1556758605
- Cited by
- 2,093
- References
- 19
- FWCI
- 12.77
- Type
- journal article
- Language
- en
- Open access
- green
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.