Microscopic evolution of social networks
The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Abstract
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at such a large scale, we study individual node arrival and edge creation processes that collectively lead to macroscopic properties of networks. Using a methodology based on the maximum-likelihood principle, we investigate a wide variety of network formation strategies, and show that edge locality plays a critical role in evolution of networks. Our findings supplement earlier network models based on the inherently non-local preferential attachment.
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
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
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 · cited 3×
“The copying [14] and the preferential attachment [ 1 ] models belong to this category.”
BackgroundInfluentialStatistical 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
(1999) · Cited by 12,854
The Psychology of Interpersonal Relations.
Newcomb, T., & Heider, F. (1958) · American Sociological Review · doi:10.2307/2089062 · Cited by 11,822
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Structural Holes: The Social Structure of Competition
Lazega, E., & Burt, R. S. (1995) · Revue Française de Sociologie · doi:10.2307/3322456 · Cited by 7,853
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
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Leskovec et al. performed low-conductance cuts with several methods, to ensure that the result is not a simple artefact of a particular chosen technique.”
BackgroundInfluentialSupervised random walks: predicting and recommending links in social networks
Backstrom, L., & Leskovec, J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935914 · Cited by 982
Self-citationCrandall, D. J., Backstrom, L., Huttenlocher, D., & Kleinberg, J. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526812 · Cited by 769
Self-citationFind me if you can: improving geographical prediction with social and spatial proximity
Backstrom, L., Sun, E., & Marlow, C. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772698 · Cited by 705
Self-citationHuman mobility, social ties, and link prediction
Wang, D., Pedreschi, D., Song, C., Giannotti, F., & Barabasi, A.-L. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020581 · Cited by 665
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
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
Exploiting place features in link prediction on location-based social networks
Scellato, S., Noulas, A., & Mascolo, C. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020575 · Cited by 522
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
Sensing Trending Topics in Twitter
Aiello, L. M., Petkos, G., Martin, C., Corney, D., Papadopoulos, S., Skraba, R., Goker, A., Kompatsiaris, I., & Jaimes, A. (2013) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2013.2265080 · Cited by 431
Structure and Evolution of Online Social Networks
Kumar, R., Novak, J., & Tomkins, A. (2010) · Link Mining: Models, Algorithms, and Applications · doi:10.1007/978-1-4419-6515-8_13 · Cited by 431
Self-citationCustomer churn prediction in telecom using machine learning in big data platform
Ahmad, A. K., Jafar, A., & Aljoumaa, K. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0191-6 · Cited by 421
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
Toward link predictability of complex networks
Lü, L., Pan, L., Zhou, T., Zhang, Y.-C., & Stanley, H. E. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1424644112 · Cited by 412
Applying centrality measures to impact analysis: A coauthorship network analysis
Yan, E., & Ding, Y. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21128 · Cited by 390
Social Network Analysis and Mining for Business Applications
Bonchi, F., Castillo, C., Gionis, A., & Jaimes, A. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961194 · 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
Community Detection and Mining in Social Media
Tang, L., & Liu, H. (2010) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00298ed1v01y201009dmk003 · Cited by 352
K-isomorphism: privacy preserving network publication against structural attacks
Cheng, J., Fu, A. W.-C., & Liu, J. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807218 · Cited by 348
No country for old members: user lifecycle and linguistic change in online communities
Danescu-Niculescu-Mizil, C., West, R., Jurafsky, D., Leskovec, J., & Potts, C. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488416 · Cited by 342
Self-citationEvolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
Evaluating 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
Link Prediction and Recommendation across Heterogeneous Social Networks
Dong, Y., Tang, J., Wu, S., Tian, J., Chawla, N. V., Rao, J., & Cao, H. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.140 · Cited by 280
Graph Summarization Methods and Applications: A Survey
Liu, Y., Safavi, T., Dighe, A., & Koutra, D. (2019) · ACM Computing Surveys · doi:10.1145/3186727 · Cited by 274
Characterizing the Community Structure of Complex Networks
Lancichinetti, A., Kivelä, M., Saramäki, J., & Fortunato, S. (2010) · PLoS ONE · doi:10.1371/journal.pone.0011976 · Cited by 267
A survey of Twitter research: Data model, graph structure, sentiment analysis and attacks
Antonakaki, D., Fragopoulou, P., & Ioannidis, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114006 · Cited by 265
A Guide to Conquer the Biological Network Era Using Graph Theory
Koutrouli, M., Karatzas, E., Paez-Espino, D., & Pavlopoulos, G. A. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.00034 · Cited by 264
Quantitative and empirical demonstration of the Matthew effect in a study of career longevity
Petersen, A. M., Jung, W.-S., Yang, J.-S., & Stanley, H. E. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1016733108 · Cited by 228
Social influence and unfollowing accelerate the emergence of echo chambers
Sasahara, K., Chen, W., Peng, H., Ciampaglia, G. L., Flammini, A., & Menczer, F. (2021) · Journal of Computational Social Science · doi:10.1007/s42001-020-00084-7 · Cited by 211
“Friendship recommendation engines suggest new ties based on common interests, beliefs, and friends, often resulting in the closure of open triads [1, 4, 57, 88].”
BackgroundThe Effect of Collective Attention on Controversial Debates on Social Media
Garimella, K., De Francisci Morales, G., Gionis, A., & Mathioudakis, M. (2017) · Proceedings of the 2017 ACM on Web Science Conference · doi:10.1145/3091478.3091486 · Cited by 56
“ynamics and, speci˙cally, in how it responds to increased collective attention in the controversial topic. Several studies have looked at how networks evolve, and proposed models of network formation [20, 21]. Densi˙cation over time is a pattern often observed [21], i.e., social networks gain more edges as the number…”
BackgroundTraffic in Social Media II: Modeling Bursty Popularity
Ratkiewicz, J., Menczer, F., Fortunato, S., Flammini, A., & Vespignani, A. (2010) · 2010 IEEE Second International Conference on Social Computing · doi:10.1109/socialcom.2010.63 · Cited by 38
“The first is a triangle-closing model for social networks [10], and the second is the “forest fire model” which attempts to capture the changing density and diameter of growing graphs [11].”
BackgroundDiverse misinformation: impacts of human biases on detection of deepfakes on networks
Lovato, J., St-Onge, J., Harp, R., Salazar Lopez, G., Rogers, S. P., Haq, I. U., Hébert-Dufresne, L., & Onaolapo, J. (2024) · npj Complexity · doi:10.1038/s44260-024-00006-y · Cited by 16
Networks never rest: An investigation of network evolution in three species of animals
Chase, I. D., Coelho, D., Lee, W., Mueller, K., & Curley, J. P. (2022) · Social Networks · doi:10.1016/j.socnet.2021.09.002 · Cited by 15
Metadata
- Authors
- Leskovec, J., Backstrom, L., Kumar, R., & Tomkins, A.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 462-470
- OpenAlex
- W2151078464
- Cited by
- 728
- References
- 42
- FWCI
- 70.03
- Type
- conference paper
- 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.