The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Microscopic evolution of social networks
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
Broder, 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×
“RELATED WORK Many studies on online social networks, world wide web, and biological networks focused on macroscopic properties of static networks such as degree distributions, diameter, clustering coefficient, communities, etc; work in this area includes [10, 21, 2, 18, 8, 7].”
BackgroundSelf-citationThe Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Self-citationLeskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Self-citationGroup formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Self-citationOn the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
The 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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
The Two-Step Flow of Communication: An Up-To-Date Report on an Hypothesis
Katz, E. (1957) · Public Opinion Quarterly · doi:10.1086/266687 · Cited by 1,544
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461
Connectivity 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
An Exponential Family of Probability Distributions for Directed Graphs
Holland, P. W., & Leinhardt, S. (1981) · Journal of the American Statistical Association · doi:10.1080/01621459.1981.10477598 · Cited by 1,190
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150476 · Cited by 1,084
Self-citationLogit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov Graphs and p
Wasserman, S., & Pattison, P. (1996) · Psychometrika · doi:10.1007/bf02294547 · Cited by 950
Handbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
Relational learning via latent social dimensions
Tang, L., & Liu, H. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557109 · Cited by 799
Stochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 676
Self-citationTransitivity in Structural Models of Small Groups
Holland, P. W., & Leinhardt, S. (1971) · Comparative Group Studies · doi:10.1177/104649647100200201 · Cited by 651
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
Mathematical results on scale‐free random graphs
Bollobás, B., & Riordan, O. M. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch1 · Cited by 463
What's new on the web?: the evolution of the web from a search engine perspective
Ntoulas, A., Cho, J., & Olston, C. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988674 · Cited by 452
Evolution of Networks: From Biological Nets to the Internet and WWWPreprint
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · RePEc: Research Papers in Economics · Cited by 330
Emergence of a Small World from Local Interactions: Modeling Acquaintance Networks
Davidsen, J., Ebel, H., & Bornholdt, S. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.128701 · Cited by 309
A large‐scale study of the evolution of Web pages
Fetterly, D., Manasse, M., Najork, M., & Wiener, J. L. (2004) · Software: Practice and Experience · doi:10.1002/spe.577 · Cited by 202
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · Oxford University Press eBooks · Cited by 190
A comparative study of social network models: Network evolution models and nodal attribute models
Toivonen, R., Kovanen, L., Kivelä, M., Onnela, J.-P., Saramäki, J., & Kaski, K. (2009) · Social Networks · doi:10.1016/j.socnet.2009.06.004 · Cited by 184
The rise and fall of a networked society: A formal model
Marsili, M., Vega-Redondo, F., & Slanina, F. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0305684101 · Cited by 172
Shi, X., Adamic, L. A., & Strauss, M. J. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.11.072 · Cited by 140
Heider vs Simmel: Emergent Features in Dynamic Structures
Krackhardt, D. M., & Handcock, M. S. (2008) · Springer eBooks · doi:10.1007/978-3-540-73133-7_2 · Cited by 93
A likelihood approach to analysis of network data
Wiuf, C., Brameier, M., Hagberg, O., & Stumpf, M. P. H. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0600061103 · Cited by 78
A Random-Surfer Web-Graph Model
Blum, A. L., Chan, T.-H. H., & Rwebangira, M. R. (2006) · Workshop on Analytic Algorithmics and Combinatorics (ANALCO) · doi:10.1137/1.9781611972962.8 · Cited by 55
Measuring the effects of preprocessing decisions and network forces in dynamic network analysis
Scripps, J., Tan, P., & Esfahanian, A. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557102 · Cited by 43
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
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.