Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.

Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer

Ipsen, Ilse C. F., Kirkland, Steve · 2006 · SIAM Journal on Matrix Analysis and Applications

Abstract

The PageRank updating algorithm proposed by Langville and Meyer is a special case of an iterative aggregation/disaggregation (SIAD) method for computing stationary distributions of very large Markov chains. It is designed, in particular, to speed up the determination of PageRank, which is used by the search engine Google in the ranking of web pages. In this paper the convergence, in exact arithmetic, of the SIAD method is analyzed. The SIAD method is expressed as the power method preconditioned by a partial LU factorization. This leads to a simple derivation of the asymptotic convergence rate of the SIAD method. It is known that the power method applied to the Google matrix always converges, and we show that the asymptotic convergence rate of the SIAD method is at least as good as that of the power method. Furthermore, by exploiting the hyperlink structure of the web it can be shown that the asymptotic convergence rate of the SIAD method applied to the Google matrix can be made strictly faster than that of the power method.

Overview

Integrity signals

Registry

Crossref · 10.1137/s0895479804439808

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 30 references

Cited by

See all 61

Metadata

Authors
Ipsen, I. C. F., & Kirkland, S.
Venue
SIAM Journal on Matrix Analysis and Applications
Published
2006-01
Volume
27
Issue
4
Pages
952-967
ISSN
  • 0895-4798 (ISSN-L)
  • 1095-7162
OpenAlex
W2166593446
Cited by
60
References
30
Citations by year
2025: 1 · 2024: 1 · 2021: 1 · 2020: 1 · 2019: 1 · 2018: 3 · 2017: 4 · 2016: 1 · 2015: 3 · 2014: 2 · 2013: 4 · 2012: 7
FWCI
7.70
Type
journal article
Language
en
Open access
closed
Locations
SIAM Journal on Matrix Analysis and Applications (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Information Systems › Web visibility and informetrics
Keywords
PageRank, convergence analysis, asymptotic convergence rate, power method, stationary distribution, Markov chains, Google matrix, web page ranking, hyperlink structure

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer. https://app.cochat.ai/papers/10.1137/s0895479804439808
The paper
Ipsen, I. C. F., & Kirkland, S. (2006). Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/s0895479804439808

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.