The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
The Sinkhorn–Knopp Algorithm: Convergence and Applications
Open accessAbstract
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn–Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic. It is known that the convergence is linear, and an upper bound has been given for the rate of convergence for positive matrices. In this paper we give an explicit expression for the rate of convergence for fully indecomposable matrices. We describe how balancing algorithms can be used to give a measure of web page significance. We compare the measure with some well known alternatives, including PageRank. We show that, with an appropriate modification, the Sinkhorn–Knopp algorithm is a natural candidate for computing the measure on enormous data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Nonnegative Matrices in the Mathematical Sciences
(1979) · Elsevier eBooks · doi:10.1016/c2013-0-10361-3 · Cited by 5,451
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
Bauer, F. L. (1963) · Numerische Mathematik · doi:10.1007/bf01385880 · Cited by 237
On the scaling of multidimensional matrices
Franklin, J., & Lorenz, J. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90490-4 · Cited by 213
An Arnoldi-type algorithm for computing page rank
Golub, G. H., & Greif, C. (2006) · BIT Numerical Mathematics · doi:10.1007/s10543-006-0091-y · Cited by 109
A new paradigm for ranking pages on the world wide web
Tomlin, J. A. (2003) · doi:10.1145/775152.775202 · Cited by 74
The rate of convergence of Sinkhorn balancing
Soules, G. W. (1991) · Linear Algebra and its Applications · doi:10.1016/0024-3795(91)90157-r · Cited by 45
Methods for scaling to doubly stochastic form
Parlett, B. Ν., & Landis, T. L. (1982) · Linear Algebra and its Applications · doi:10.1016/0024-3795(82)90099-4 · Cited by 43
Cited by
Optimal Transport for Domain Adaptation
Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2615921 · Cited by 989
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
A Tour of Modern Image Filtering: New Insights and Methods, Both Practical and Theoretical
Milanfar, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2179329 · Cited by 605
A fast algorithm for matrix balancing
Knight, P. A., & Ruiz, D. (2013) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drs019 · Cited by 507
Self-citationConvolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Metadata
- Authors
- Knight, P. A.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2008-01
- Volume
- 30
- Issue
- 1
- Pages
- 261-275
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W250209774
- Cited by
- 372
- References
- 11
- FWCI
- 6.10
- Type
- journal article
- Language
- en
- Open access
- green
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: The Sinkhorn–Knopp Algorithm: Convergence and Applications. https://app.cochat.ai/papers/10.1137/060659624
- The paper
- Knight, P. A. (2008). The Sinkhorn–Knopp Algorithm: Convergence and Applications. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/060659624
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.