The DOI matches its Crossref record; 49 of the 50 references it cites were found in a registry or an index.
Measurement and analysis of online social networks
Abstract
Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This rate is 23-fold lower than typical human social networks (20-30% reciprocity) 35,39 .”
From The Moltbook Illusion: Separating Human Influence from Emergent Behavior in AI Agent Societies (2026) · cites this paper as [39]
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 18,005
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 9,032
Power-law distributions in empirical data
Clauset, A. J., Shalizi, C. R., & Newman, M. E. J. (2018) · Figshare · doi:10.1184/r1/6586835.v1 · Cited by 6,710
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 5,528
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,550
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/316188.316229 · Cited by 4,279
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (1999) · Nature · doi:10.1038/43601 · Cited by 4,240
Newman, M. (2002) · Physical review. E, Statistical, nonlinear, and soft matter physics · doi:10.1103/physreve.67.026126 · Cited by 3,130
Classes 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
A critical point for random graphs with a given degree sequence
Molloy, M. S. O., & Reed, B. A. (1995) · Random Structures and Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,267
Kleinberg, J. M. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335325 · Cited by 1,905
Group 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
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,730
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150476 · Cited by 1,091
Computer Relaying for Power Systems
PHADKE, A. G., & Thorp, J. S. (2009) · Wiley eBooks · doi:10.1002/9780470749722 · Cited by 1,005
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 999
Analysis of topological characteristics of huge online social networking services
Ahn, Y., Han, S., Kwak, H., Moon, S. B., & Jeong, H. (2007) · International World Wide Web Conference (WWW) · doi:10.1145/1242572.1242685 · Cited by 955
Geographic routing in social networks
Liben‐Nowell, D., Novak, J., Kumar, R., Raghavan, P., & Tomkins, A. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0503018102 · Cited by 843
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Molloy, M. S. O., & Reed, B. A. (1998) · Combinatorics Probability Computing · doi:10.1017/s0963548398003526 · Cited by 816
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. D. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159945 · Cited by 734
Braitenberg, V., & Schüz, A. (1991) · Studies of brain function · doi:10.1007/978-3-662-02728-8 · Cited by 659
Friends, Friendsters, and Top 8: Writing community into being on social network sites
Boyd, D. (2006) · First Monday · doi:10.5210/fm.v11i12.1418 · Cited by 636
Pool, I. D. S., & Kochen, M. (1978) · Social Networks · doi:10.1016/0378-8733(78)90011-4 · Cited by 629
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Li, L., Alderson, D., Doyle, J. C., & Willinger, W. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129111 · Cited by 570
Statistical properties of sampled networks
Lee, S. H., Kim, P., & Jeong, H. (2006) · Physical Review E · doi:10.1103/physreve.73.016102 · Cited by 446
Adamic, L. A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48155-9_27 · Cited by 404
Kleinberg, J. M., & Lawrence, S. (2001) · Science · doi:10.1126/science.1067014 · Cited by 322
Systematic topology analysis and generation using degree correlations
Mahadevan, P., Krioukov, D., Fall, K., & Vahdat, A. (2006) · Cited by 269
A social network caught in the Web
Adamic, L. A., Buyukkokten, O., & Adar, E. (2003) · First Monday · doi:10.5210/fm.v8i6.1057 · Cited by 267
Cooperative peer groups in NICE
Lee, S., Sherwood, R., & Bhattacharjee, B. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1208963 · Cited by 263
Self-citationSybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159945 · Cited by 260
Cooperative peer groups in NICE
Sherwood, R., Lee, S., & Bhattacharjee, B. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.07.012 · Cited by 214
Self-citationExploiting Social Networks for Internet Search
Mislove, A., Gummadi, K. P., & Druschel, P. (2006) · Cited by 175
Self-citationGarriss, S., Kaminsky, M., Freedman, M. J., Karp, B. N., Mazières, D., & Yu, H. (2006) · Networked Systems Design and Implementation · Cited by 133
Systematic topology analysis and generation using degree correlations
Mahadevan, P., Krioukov, D., Fall, K., & Vahdat, A. (2006) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1159913.1159930 · Cited by 123
Short paths in expander graphs
Kleinberg, J. M., & Rubinfeld, R. (2002) · doi:10.1109/sfcs.1996.548467 · Cited by 110
Jellyfish: A conceptual model for the as Internet topology
Siganos, G., Tauro, S. L., & Faloutsos, M. (2006) · Journal of Communications and Networks · doi:10.1109/jcn.2006.6182774 · Cited by 81
A Comparison of Sampling Techniques for Web Graph Characterization
Becchetti, L., Castillo, C., & Fazzone, A. (2006) · Cited by 54
Freeman, L. C., Mitchell, J. C., & Ziegler, R. (1978) · Social Networks · doi:10.1016/0378-8733(78)90010-2 · Cited by 50
A pragmatic approach to dealing with high-variability in network measurements
Willinger, W., Alderson, D., & Li, L. (2004) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1028788.1028800 · Cited by 50
Diversity of graphs with highly variable connectivity
Alderson, D., & Li, L. (2007) · Physical Review E · doi:10.1103/physreve.75.046102 · Cited by 46
KeyChains: A Decentralized Public-Key Infrastructure
Morselli, R., Bhattacharjee, B., Katz, J. I., & Marsh, M. (2006) · University Libraries (University of Maryland) · Cited by 17
Self-citationDistributed Uniform Sampling in Real- World Networks
Awan, A., Ferreira, R. A., Jagannathan, S., & Grama, A. Y. (2004) · Purdue e-Pubs (Purdue University System) · Cited by 10
Research works printed but not linked: 6
- 10.5555/646632.699477 · DOI
- A. Broder , R. Kumar , F. Maghoul , P. Raghavan , S. Rajagopalan , R. Stata , A. Tomkins , and J. Wiener . Graph Structure in the Web: Experiments and Models . In Proceedings of the 9th International World Wide Web Conference (WWW'00) , Amsterdam , May 2000 . A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph Structure in the Web: Experiments and Models. In Proceedings of the 9th International World Wide Web Conference (WWW'00), Amsterdam, May 2000.
- P. Erdös and A. Rényi . On Random Graphs I. Publicationes Mathematicae Debrecen , 5 : 290 -- 297 , 1959 . P. Erdös and A. Rényi. On Random Graphs I. Publicationes Mathematicae Debrecen, 5:290--297, 1959.
- 10.5555/874062.875507 · DOI
- MySpace is the number one website in the U. S. according to Hitwise . HitWise Press Release , July, 11, 2006 . http://www.hitwise.com/press-center/hitwiseHS2004/social-networking-june-2006.php. MySpace is the number one website in the U.S. according to Hitwise. HitWise Press Release, July, 11, 2006. http://www.hitwise.com/press-center/hitwiseHS2004/social-networking-june-2006.php.
- D. Rezner . The Power and Politics of Weblogs. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (CSCW'04) , Chicago, IL , Nov 2004 . D. Rezner. The Power and Politics of Weblogs. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (CSCW'04), Chicago, IL, Nov 2004.
Cited by
Sorted by citations
Defining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2013) · Knowledge and Information Systems · doi:10.1007/s10115-013-0693-z · Cited by 1,531
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
Self-citationDe-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2009.22 · Cited by 1,324
Michaelidou, N., Siamagka, N., & Christodoulides, G. (2011) · Industrial Marketing Management · doi:10.1016/j.indmarman.2011.09.009 · Cited by 1,004
An overview of online fake news: Characterization, detection, and discussion
Zhang, X., & Ghorbani, A. A. (2020) · Information Processing & Management · doi:10.1016/j.ipm.2019.03.004 · Cited by 997
Metadata
- Authors
- Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B.
- Affiliations
- Max Planck Institute for Software Systems (DE)
- University of Maryland, College Park (US)
- Venue
- Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
- Publisher
- ACM
- Published
- 2007-10-24
- Pages
- 29-42
- OpenAlex
- W2115022330
- Cited by
- 3,057
- References
- 50
- Citations by year
- 2026: 31 · 2025: 41 · 2024: 55 · 2023: 73 · 2022: 97 · 2021: 124 · 2020: 144 · 2019: 146 · 2018: 187 · 2017: 194 · 2016: 205 · 2015: 256 · 2014: 268 · 2013: 306 · 2012: 315
- FWCI
- 147.48
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM Internet Measurement Conference (IMC) (publishedVersion)
- Max Planck Digital Library (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- Funders
- European Commission
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Data Mining
- Keywords
- social networking sites, social graphs, large-scale graph analysis, Orkut, YouTube, Flickr, network topology
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
