The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
The Web as a graph
Abstract
The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph has about a billion nodes today, several billion links, and appears to grow exponentially with time. There are many reasons—mathematical, sociological, and commercial—for studying the evolution of this graph. We first review a set of algorithms that operate on the Web graph, addressing problems from Web search, automatic community discovery, and classification. We then recall a number of measurements and properties of the Web graph. Noting that traditional random graph models do not explain these observations, we propose a new family of random graph models.
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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Bollobás, B. (1985) · Cited by 6,196
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Bibliographic coupling between scientific papers
Kessler, M. M. (1963) · American Documentation · doi:10.1002/asi.5090140103 · Cited by 2,855
Garfield, E. (1972) · Science · doi:10.1126/science.178.4060.471 · Cited by 2,788 · cited 1×
“The eld of bibliometrics [17, 19] is concerned with citation analysis; some of these insights have been applied to the Web as well [28].”
BackgroundThe frequency distribution of scientific productivity
Lotka, A. J. (1926) · Journal of the Washington Academy of Sciences · Cited by 2,246
Focused crawling: a new approach to topic-specific Web resource discovery
Chakrabarti, S., van den Berg, M., & Dom, B. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00052-3 · Cited by 1,486
The Lorel query language for semistructured data
Abiteboul, S., Quass, D., McHugh, J., Widom, J., & Wiener, J. L. (1997) · International Journal on Digital Libraries · doi:10.1007/s007990050005 · Cited by 1,058
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 1,000
Self-citationA 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
Enhanced hypertext categorization using hyperlinks
Chakrabarti, S., Dom, B., & Indyk, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276332 · Cited by 769
An introduction to informetrics
Tague-Sutcliffe, J. (1992) · Information Processing & Management · doi:10.1016/0306-4573(92)90087-g · Cited by 758
Automatic resource compilation by analyzing hyperlink structure and associated text
Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., & Kleinberg, J. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00087-7 · Cited by 697
Self-citationImproved Algorithms for Topic Distillation in a Hyperlinked Environment
Bharat, K., & Henzinger, M. R. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130367 · Cited by 676
Database techniques for the World-Wide Web: a survey
Florescu, D., Levy, A., & Mendelzon, A. (1998) · ACM SIGMOD Record · doi:10.1145/290593.290605 · Cited by 561
Finding Regular Simple Paths in Graph Databases
Mendelzon, A. O., & Wood, P. T. (1995) · SIAM Journal on Computing · doi:10.1137/s009753979122370x · Cited by 399
A technique for measuring the relative size and overlap of public Web search engines
Bharat, K., & Broder, A. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00127-5 · Cited by 389
Mendelzon, A. O., Mihaila, G. A., & Milo, T. (1997) · International Journal on Digital Libraries · doi:10.1007/s007990050004 · Cited by 312
The Analysis of Economic Time Series.
Paradiso, L. J., & Davis, H. T. (1942) · Journal of the American Statistical Association · doi:10.2307/2279233 · Cited by 291
Larson, R. R. (1996) · Cited by 253
Extracting Large-Scale Knowledge Bases from the Web
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Cited by 239
Self-citationA Simulation of the Structure of Academic Science
Gilbert, N. (1997) · Sociological Research Online · doi:10.5153/sro.85 · Cited by 222
WebQuery: searching and visualizing the Web through connectivity
Carrière, S. J., & Kazman, R. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00062-7 · Cited by 173
ParaSite: mining structural information on the Web
Spertus, E. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00033-0 · Cited by 166
Applications of a Web query language
Arocena, G. O., Mendelzon, A. O., & Mihaila, G. A. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00043-3 · Cited by 103
(1949) · Max Planck Digital Library
Cited by
Survey of graph database models
Angles, R., & Gutierrez, C. (2008) · ACM Computing Surveys · doi:10.1145/1322432.1322433 · Cited by 1,706
Algorithms, games, and the internet
Papadimitriou, C. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380883 · Cited by 1,085
The Power Grid as a complex network: A survey
Pagani, G. A., & Aiello, M. (2013) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.01.023 · Cited by 813
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
Community detection in Social Media: Performance and application considerations
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., & Spyridonos, P. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0224-z · Cited by 615
Metadata
- Authors
- Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tompkins, A., & Upfal, E.
- Venue
- Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00
- Publisher
- ACM Press
- Published
- 2000
- Pages
- 1-10
- OpenAlex
- W1981086745
- Cited by
- 288
- References
- 28
- FWCI
- 44.32
- 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.