eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2007-06-28
1
18
10.4230/DagSemProc.07071.16
article
The Sinkhorn-Knopp Algorithm:Convergence and Applications
Knight, Philip A.
As long as a square nonnegative matrix $A$ contains sufficient nonzero
elements, the Sinkhorn-Knopp algorithm can be used to balance the matrix,
that is, to find a diagonal scaling of $A$ that is doubly stochastic.
We relate balancing to problems in traffic flow and describe how balancing
algorithms can be used to give a two sided measure of nodes in a graph. We
show that with an appropriate modification, the Sinkhorn-Knopp algorithm is a
natural candidate for computing the measure on enormous data sets.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07071/DagSemProc.07071.16/DagSemProc.07071.16.pdf
Matrix balancing
Sinkhorn-Knopp algorithm
PageRank
doubly stochastic matrix