Distribution of PageRank Mass Among Principle Components of the Web
Open accessIntegrity 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?
The corresponding moments of X and N always exist together.
“Moreover, since the corresponding moments of X and N always exist together [26], we use only moments of X”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [26]
If X is regularly varying, then N(X) is also regularly varying and asymptotically identical to X.
“Thus, if X is regularly varying then N(X) is also regularly varying and asymptotically identical to X (see, e.g. [26]):”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [26]
It has become common knowledge that the in-degree and PageRank of the Web follow a power law with the same exponent.
“It has become common knowledge that the in-degree and PageRank of the Web follow a power law with the same exponent (see [14], [26], [32], and [37]).”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [26]
The last expression is the value of C_N in the case when the out-degree of all nondangling nodes is a constant E(N)/(1-p0), as in [26].
“The last expression is the value of CN in the case when the out-degree of all nondangling nodes is a constant E (N)/( 1 -p 0 ) , as in [26].”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [26]
Cites
(1999) · Cited by 12,854 · see citing works
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 9,032 · see citing works
Non-negative Matrices and Markov Chains
Seneta, E. B. (1981) · Springer series in statistics · doi:10.1007/0-387-32792-4 · Cited by 2,858 · see citing works
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 · see citing works
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · Cited by 1,204 · see citing works
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Haveliwala, T. H. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1208999 · Cited by 1,046 · see citing works
Langville, A. N., & Meyer, C. D. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 885 · see citing works
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · doi:10.1515/9781400830329 · Cited by 814 · see citing works
Numerical Computing with Matlab
Moler, C. (2004) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717952 · Cited by 650 · see citing works
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539 · see citing works
Finding scientific gems with Google’s PageRank algorithm
Chen, P., Xie, H., Maslov, S., & Redner, S. (2007) · Journal of Informetrics · doi:10.1016/j.joi.2006.06.001 · Cited by 483 · see citing works
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 · see citing works
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 470 · see citing works
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tompkins, A., & Upfal, E. (2000) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/335168.335170 · Cited by 288 · 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 · cited 1× · see citing works
“Of course, a drastic reduction of c also considerably accelerates the computation of PageRank by numerical methods [22, 5, 23].”
MethodSelf-citationEiron, N., McCurley, K. S., & Tomlin, J. A. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988714 · Cited by 216 · see citing works
PageRank as a function of the damping factor
Boldi, P., Santini, M., & Vigna, S. (2005) · International World Wide Web Conference (WWW) · doi:10.1145/1060745.1060827 · Cited by 204 · 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
Non-negative Matrices and Markov Chains (Springer Series in Statistics)
Seneta, E. B. (1981) · Cited by 194 · see citing works
The Effect of New Links on Google PageRank
Litvak, N., & Avrachenkov, K. E. (2004) · HAL · Cited by 113 · see citing works
Self-citationMathematical Foundations of the State Lumping of Large Systems
Korolyuk, V. S., & Turbin, A. F. (1993) · Springer eBooks · doi:10.1007/978-94-011-2072-2 · Cited by 103 · see citing works
Theory of Suboptimal Decisions
Pervozvanskiĭ, A. A., & Gaitsgori, V. G. (1988) · Springer eBooks · doi:10.1007/978-94-009-2833-6 · Cited by 89 · see citing works
RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
Fortunato, S., & Flammini, A. (2007) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127407018439 · Cited by 44 · see citing works
Yin, G. G., & Zhang, Q. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.876962 · Cited by 38 · see citing works
Flagged first, then by citations
1 of the 25 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
Boldi, P., Santini, M., & Vigna, S. (2009) · ACM Transactions on Information Systems · doi:10.1145/1629096.1629097 · Cited by 104 · see citing works
An Inner-Outer Iteration for Computing PageRank
Gleich, D. F., Gray, A. P., Greif, C., & Lau, T. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/080727397 · Cited by 82 · see citing works
Asymptotic 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
Self-citationGleich, D. F., Constantine, P. G., Flaxman, A. D., & Gunawardana, A. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772730 · Cited by 53 · see citing works
Νικολακόπουλος, Α. Ν., & Garofalakis, J. D. (2013) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2433396.2433415 · Cited by 34 · see citing works
Google matrix, dynamical attractors, and Ulam networks
Shepelyansky, D. L., & Zhirov, O. V. (2010) · Physical Review E · doi:10.1103/physreve.81.036213 · Cited by 27 · see citing works
Silvestrov, D. S., & Silvestrov, S. D. (2017) · AIP conference proceedings · doi:10.1063/1.4972739 · Cited by 18 · see citing works
Universal emergence of PageRank
Frahm, K. M., Georgeot, B., & Shepelyansky, D. L. (2011) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/44/46/465101 · Cited by 18 · see citing works
Algorithms and Models for the Web-Graph
(2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77004-6 · Cited by 17 · see citing works
Regularization-based solution of the PageRank problem for large matrices
Polyak, B. T., & Александрович, Т. А. (2012) · Automation and Remote Control · doi:10.1134/s0005117912110094 · Cited by 17 · see citing works
Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
Silvestrov, D. S., & Silvestrov, S. D. (2016) · International Symposium on Stochastic Models in Reliability Engineering, Life Science and Operations Management · doi:10.1109/smrlo.2016.18 · Cited by 15 · see citing works
Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering
Avrachenkov, K. E., Kadavankandy, A., & Litvak, N. (2018) · Journal of Statistical Physics · doi:10.1007/s10955-018-2099-5 · Cited by 13 · see citing works
Self-citationEigenvectors of directed graphs and importance scores: dominance, T-Rank, and sink remedies
Bjelland, J., Burgess, M., Canright, G., & Engø‐Monsen, K. (2009) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-009-0154-1 · Cited by 13 · see citing works
Surfing the Network for Ranking by Multidamping
Kollias, G., Gallopoulos, E., & Grama, A. Y. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.15 · Cited by 10 · see citing works
A new approach for affinity relationship discovery in online forums
Tshimula, J. M., Chikhaoui, B., & Wang, S. (2020) · Social Network Analysis and Mining · doi:10.1007/s13278-020-00644-9 · Cited by 9 · see citing works
Tshimula, J. M., Chikhaoui, B., & Wang, S. (2019) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/3341161.3342888 · Cited by 8 · see citing works
Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
Silvestrov, D. S., & Silvestrov, S. D. (2016) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-319-42105-6_10 · Cited by 6 · see citing works
Random Surfing Without Teleportation
Νικολακόπουλος, Α. Ν., & Garofalakis, J. D. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24024-4_19 · Cited by 6 · see citing works
Income Inequality in the Attention Economy
McCurley, K. S. (2007) · Cited by 5 · see citing works
Stochastic analysis of web page ranking
Volkovich, Y. (2009) · doi:10.3990/1.9789036528238 · Cited by 4 · see citing works
Incorporating the surfing behavior of web users into pagerank
Ashyralyyev, S., Cambazoglu, B. B., & Aykanat, C. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2505668 · Cited by 3 · see citing works
Flori, E., Zhu, Y., Paterlini, S., Pattarin, F., & Villani, M. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-31183-3_4 · Cited by 3 · see citing works
SmartNews: Bringing Order into Comments Chaos
Litvak, M., & Matz, L. (2013) · International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management · doi:10.5220/0004618301910196 · Cited by 3 · see citing works
Fast Personalized PageRank for Customized Analysis Range Using Static Index
Yamashita, T., & Kaneko, K. (2024) · International Conference on Ubiquitous and Future Networks · doi:10.1109/icufn61752.2024.10625115 · Cited by 1 · see citing works
(2011) · SpringerReference · doi:10.1007/springerreference_60484 · Cited by 1 · see citing works
Iterative Aggregation - Disaggregation Methods and Ordering Algorithms
Pultarová, I. (2008) · International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS) · doi:10.4108/icst.valuetools2008.4271
Calibratable Hetero-NodeRank for measuring node influencePreprint
Ma, Q., & Gong, Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.02666
Bjelland, J., Canright, G., & Engø‐Monsen, K. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_112
- Authors
- Avrachenkov, K., Litvak, N., & Pham, K. S.
- Affiliations
- Institut national de recherche en sciences et technologies du numérique (FR)
- University of Twente (NL)
- St Petersburg University (RU)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-11-14
- Pages
- 16-28
- OpenAlex
- W2115687977
- Cited by
- 29
- References
- 25
- Citations by year
- 2024: 1 · 2023: 1 · 2021: 1 · 2020: 1 · 2019: 1 · 2018: 1 · 2017: 1 · 2016: 2 · 2015: 1 · 2013: 4 · 2012: 1
- FWCI
- 2.66
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Springer eBooks (publishedVersion)
- University of Twente Research Information (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- University of Twente Research Information (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Information Systems › Web visibility and informetrics
- Keywords
- PageRank, damping factor, web graph, principal components, bow-tie structure, dead ends, singular perturbation
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
