The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
The Web as a Graph: Measurements, Models, and Methods
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Self-citationBollobás, B. (1985) · Cited by 6,196
Bibliographic coupling between scientific papers
Kessler, M. M. (1963) · American Documentation · doi:10.1002/asi.5090140103 · Cited by 2,855
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×
“The structure of the Web has been analyzed by [ 2 ].”
MethodSelf-citationGarfield, E. (1972) · Science · doi:10.1126/science.178.4060.471 · Cited by 2,788 · cited 1×
“The eld of bibliometrics [14, 16] has studied phenomena in citation; some of these insights have been applied to the Web as well [25].”
BackgroundThe frequency distribution of scientific productivity
Lotka, A. J. (1926) · Journal of the Washington Academy of Sciences · Cited by 2,246
Research works printed but not linked: 5
- S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. Weiner. The Lorel Query language for semistructured data. Intl. J. on Digital Libraries, 1(1):68–88, 1997. · doi:10.1007/s007990050001
- S. Chakrabarti, B. Dom, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Experiments in topic distillation. SIGIR workshop on hypertext IR, 1998.
- L. Egghe, R. Rousseau, Introduction to Informetrics, Elsevier, 1990.
- D. Konopnicki and O. Shmueli. Information gathering on the World Wide Web: the W3QL query language and the W3QS system. Trans. on Database Systems, 1998. · doi:10.1145/296854.277639
- S. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins. Trawling emerging cyber-communities automatically. Proc. 8th WWW Conf., 1999.
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
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-citationGraphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Self-citationNewman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
The Large‐Scale Structure of Semantic Networks: Statistical Analyses and a Model of Semantic Growth
Steyvers, M., & Tenenbaum, J. B. (2005) · Cognitive Science · doi:10.1207/s15516709cog2901_3 · Cited by 1,387
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,255
A Brief History of Generative Models for Power Law and Lognormal Distributions
Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129088 · Cited by 1,188
Scholarly communication and bibliometrics
Borgman, C. L., & Furner, J. (2002) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440360102 · Cited by 1,121
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lu, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 938
A random graph model for massive graphs
Aiello, W., Chung, F., & Lu, L. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335326 · Cited by 917
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
SCAN: a structural clustering algorithm for networks
Xu, X., Yuruk, N., Feng, Z., & Schweiger, T. A. J. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281280 · Cited by 842
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
The degree sequence of a scale‐free random graph process
Bollobás, B., Riordan, O., Spencer, J., & Tusnády, G. (2001) · Random Structures & Algorithms · doi:10.1002/rsa.1009 · Cited by 804
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
Finding local community structure in networks
Clauset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.026132 · Cited by 788
Kronecker Graphs: An Approach to Modeling Networks
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., & Ghahramani, Z. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4905 · Cited by 697
Self-citationStochastic 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-citationMeeting Strangers and Friends of Friends: How Random Are Social Networks?
Jackson, M. O., & Rogers, B. W. (2007) · American Economic Review · doi:10.1257/aer.97.3.890 · Cited by 633
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
Mixture models and exploratory analysis in networks
Newman, M. E. J., & Leicht, E. A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610537104 · Cited by 554
An analysis of Internet content delivery systems
Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., & Levy, H. M. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844158 · Cited by 546
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. (2007) · Random Structures & Algorithms · doi:10.1002/rsa.20168 · Cited by 545
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
Spectra of “real-world” graphs: Beyond the semicircle law
Farkas, I. J., Derényi, I., Barabási, A.-L., & Vicsek, T. (2001) · Physical Review E · doi:10.1103/physreve.64.026704 · Cited by 499
Spectra of random graphs with given expected degrees
Chung, F., Lu, L., & Vu, V. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0937490100 · Cited by 492
The stochastic approach for link-structure analysis (SALSA) and the TKC effect
Lempel, R., & Moran, S. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00034-7 · Cited by 481
Greedy Approximation Algorithms for Finding Dense Components in a Graph
Charikar, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44436-x_10 · Cited by 479
Citation Statistics from 110 Years of Physical Review
Redner, S. (2005) · Physics Today · doi:10.1063/1.1996475 · Cited by 426
Extrapolation methods for accelerating PageRank computations
Kamvar, S. D., Haveliwala, T. H., Manning, C. D., & Golub, G. H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775190 · Cited by 407
A Random Graph Model for Power Law Graphs
Aiello, W., Chung, F., & Lu, L. (2001) · Experimental Mathematics · doi:10.1080/10586458.2001.10504428 · Cited by 405
Network topology generators: degree-based vs. structural
Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., & Willinger, W. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633040 · Cited by 375
Finding Frequent Patterns in a Large Sparse Graph*
Kuramochi, M., & Karypis, G. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0003-9 · Cited by 371
SALSA: the stochastic approach for link-structure analysis
Lempel, R., & Moran, S. (2001) · ACM Transactions on Information Systems · doi:10.1145/382979.383041 · Cited by 362
Toward a basic framework for webometrics
Björneborn, L., & Ingwersen, P. (2004) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20077 · Cited by 359
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
Leskovec, J., Chakrabarti, D., Kleinberg, J., & Faloutsos, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564126_17 · Cited by 356
Self-citationCurvature of co-links uncovers hidden thematic layers in the World Wide Web
Eckmann, J.-P., & Moses, E. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.032093399 · Cited by 346
Modularity-maximizing graph communities via mathematical programming
Agarwal, G., & Kempe, D. (2008) · The European Physical Journal B · doi:10.1140/epjb/e2008-00425-1 · Cited by 338
Duplication Models for Biological Networks
Chung, F., Lu, L., Dewey, T. G., & Galas, D. J. (2003) · Journal of Computational Biology · doi:10.1089/106652703322539024 · Cited by 322
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
(2003) · Cited by 312
Web science: an interdisciplinary approach to understanding the web
Hendler, J., Shadbolt, N., Hall, W., Berners-Lee, T., & Weitzner, D. (2008) · Communications of the ACM · doi:10.1145/1364782.1364798 · Cited by 308
The Average Distance in a Random Graph with Given Expected Degrees
Chung, F., & Lu, L. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129081 · Cited by 307
Bollobás, B., Borgs, C., Chayes, J., & Riordan, O. M. (2003) · doi:10.5555/644108.644133 · Cited by 302
Graph Evolution: Densification and Shrinking Diameters
Leskovec, J., Kleinberg, J. M., & Faloutsos, C. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0603229 · Cited by 300
Self-citationImpact of search engines on page popularity
Cho, J., & Roy, S. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988676 · Cited by 281
Technological Networks and the Spread of Computer Viruses
Balthrop, J., Forrest, S., Newman, M. E. J., & Williamson, M. M. (2004) · Science · doi:10.1126/science.1095845 · Cited by 279
Correlating financial time series with micro-blogging activity
Ruiz, E. J., Hristidis, V., Castillo, C., Gionis, A., & Jaimes, A. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124358 · Cited by 272
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
The Economics of Social Networks
Jackson, M. O. (2013) · Advances in Economics and Econometrics · doi:10.1017/cbo9781139052269.003 · Cited by 264
Mahboob, S., & Liu, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3347145 · Cited by 255
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
Avrachenkov, K., Litvak, N., Nemirovsky, D., & Osipova, N. (2007) · SIAM Journal on Numerical Analysis · doi:10.1137/050643799 · Cited by 250
It's who you know: graph mining using recursive structural features
Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., & Faloutsos, C. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020512 · Cited by 223
“Other local and community-level observations show that degree distributions in many graphs follow power-laws [5, 7, 17, 24] and that graphs exhibit modular structure, with nodes forming groups, and groups within groups [9, 14].”
BackgroundSocial 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
Using PageRank to Characterize Web Structure
Pandurangan, G., Raghavan, P., & Upfal, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45655-4_36 · Cited by 164
Self-citationStochastic modeling of citation slips
Simkin, M. V., & Roychowdhury, V. P. (2005) · Scientometrics · doi:10.1007/s11192-005-0028-2 · Cited by 135
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication
Buluc, A., & Gilbert, J. R. (2008) · 2008 37th International Conference on Parallel Processing · doi:10.1109/icpp.2008.45 · Cited by 112
Algorithmic Challenges in Web Search Engines
Henzinger, M. R. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129079 · Cited by 81
“This led to the copy graph model of Kleinberg et al. [Kleinberg et al. 99] and all its modi fi cations [Kumar et al. 00, Pandurangan et al. 02].”
BackgroundMethodEstimating search engine index size variability: a 9-year longitudinal study
van den Bosch, A., Bogers, T., & de Kunder, M. (2016) · Scientometrics · doi:10.1007/s11192-016-1863-z · Cited by 77
Efficient PageRank approximation via graph aggregation
Broder, A. Z., Lempel, R., Maghoul, F., & Pedersen, J. (2006) · Information Retrieval · doi:10.1007/s10791-006-7146-1 · Cited by 72
Mowshowitz, A., & Kawaguchi, A. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2004.05.005 · Cited by 68
Traffic 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
"Rich-Get-Richer"? Platform Attention and Earnings Inequality using Patreon Earnings Data
Strauss, I., Yang, J., & Mazzucato, M. (2025) · arXiv
Metadata
- Authors
- Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 1-17
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2129620481
- Cited by
- 1,016
- References
- 32
- FWCI
- 43.84
- 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.