Graph structure in the Web
Integrity signals
Registry
Cites
Statistics
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 Web, the power-law exponents are believed to satisfy α = 1.1 for the in-degree and PageRank, and α ≈ 2 for the out-degree.
“In the Web, the power law exponents can deviate depending on a data set and an estimator, but are believed to satisfy α = 1 . 1 for the in-degree and PageRank, and α ≈ 2 for the out-degree [9], [32], [38].”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [9]
Most experimental studies of the Web agree that the in-degree, the out-degree, and the PageRank of the Web follow power laws.
“Most experimental studies of the Web agree that the in-degree, the out-degree, and the PageRank of the Web follow power laws.”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [9]
Cites
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 · see citing works
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 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
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 · see citing works
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · see citing works
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010 · see citing works
Defining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450 · see citing works
Cortical high-density counterstream architectures
Markov, N. T., Ercsey-Ravasz, M., Van Essen, D. C., Knoblauch, K., Toroczkai, Z., & Kennedy, H. (2013) · Science · doi:10.1126/science.1238406 · Cited by 616 · see citing works
Computer‐Assisted Synthetic Planning: The End of the Beginning
Szymkuć, S., Gajewska, E. P., Klucznik, T., Molga, K., Dittwald, P., Startek, M., Bajczyk, M., & Grzybowski, B. A. (2016) · Angewandte Chemie International Edition · doi:10.1002/anie.201506101 · Cited by 611 · see citing works
Maximal planar networks with large clustering coefficient and power-law degree distribution
Zhou, T., Yan, G., & Wang, B.-H. (2005) · Physical Review E · doi:10.1103/physreve.71.046141 · Cited by 265 · see citing works
Search engine coverage bias: evidence and possible causes
Vaughan, L., & Thelwall, M. (2004) · Information Processing & Management · doi:10.1016/s0306-4573(03)00063-3 · Cited by 259 · see citing works
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 · see citing works
Dill, S., Kumar, R., Mccurley, K. S., Rajagopalan, S., Sivakumar, D., & Tomkins, A. (2002) · ACM Transactions on Internet Technology · doi:10.1145/572326.572328 · Cited by 197 · see citing works
Self-citationUsing 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 · see citing works
Self-citationOn the origins of hierarchy in complex networks
Corominas-Murtra, B., Goñi, J., Solé, R. V., & Rodríguez-Caso, C. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1300832110 · Cited by 160 · see citing works
CatchSync: catching synchronized behavior in large directed graphs
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623632 · Cited by 151 · see citing works
Rethinking search: making domain experts out of dilettantes
Metzler, D., Tay, Y., Bahri, D., & Najork, M. (2021) · ACM SIGIR Forum · doi:10.1145/3476415.3476428 · Cited by 112 · see citing works
Catching Synchronized Behaviors in Large Networks: A Graph Mining Approach
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2746403 · Cited by 88 · see citing works
Discovering Opinion Spammer Groups by Network Footprints
Ye, J., & Akoglu, L. (2015) · Proceedings of the 2015 ACM on Conference on Online Social Networks · doi:10.1145/2817946.2820606 · Cited by 84 · see citing works
Inferring Strange Behavior from Connectivity Pattern in Social Networks
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-06608-0_11 · Cited by 82 · see citing works
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 · see citing works
Self-citationAsymptotic analysis for personalized Web search
Volkovich, Y., & Litvak, N. (2010) · Advances in Applied Probability · doi:10.1239/aap/1275055243 · Cited by 69 · see citing works
Inferring lockstep behavior from connectivity pattern in large graphs
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-015-0883-y · Cited by 43 · see citing works
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 · see citing works
Distribution of PageRank Mass Among Principle Components of the Web
Avrachenkov, K., Litvak, N., & Pham, K. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_2 · Cited by 29 · see citing works
Hierarchy in directed random networks
Mones, E. (2013) · Physical Review E · doi:10.1103/physreve.87.022817 · Cited by 16 · see citing works
Investigating Fake and Reliable News Sources Using Complex Networks Analysis
Mazzeo, V., & Rapisarda, A. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.886544 · Cited by 6 · see citing works
- Authors
- Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J.
- Affiliations
- IBM Research - Almaden (US)
- Corresponding author
- Kumar, Ravi
- Venue
- Computer Networks
- Publisher
- Elsevier BV
- Published
- 2000-06
- Volume
- 33
- Issue
- 1-6
- Pages
- 309-320
- ISSN
- 1389-1286 (ISSN-L)
- OpenAlex
- W2175110005
- Cited by
- 2,810
- References
- 2
- Citations by year
- 2026: 15 · 2025: 36 · 2024: 35 · 2023: 50 · 2022: 31 · 2021: 82 · 2020: 87 · 2019: 85 · 2018: 106 · 2017: 97 · 2016: 119 · 2015: 109 · 2014: 137 · 2013: 169 · 2012: 154
- FWCI
- 63.75
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Computer Networks (publishedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
- Physical Sciences › Computer Science › Information Systems › Web visibility and informetrics
- Keywords
- World Wide Web, web graph, graph structure, web crawling, web search, community detection, web evolution, AltaVista
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
