Diagonal equivalence to matrices with prescribed row and column sums. II
Richard Sinkhorn
- Vol. 45, Iss: 2, pp 195-198
Reads0
Chats0
TLDR
In this article, it was shown that if A is a nonnegative fully indecomposable matrix, i.e. A contains no s x (n s) zero submatrix, then there exists a doubly stochastic matrix of the form D 1AD2 where DI and D2 are diagonal matrices with positive main diagonals.Abstract:
Let A be a nonnegative m x n matrix and let r= (rl, ** I rm) and c = (c1' * c ) be positive vectors such that ?m r. = zn. c1. It is well known that if there exists a nonnegative z =1 z ]-=1 m x n matrix B with the same zero pattern as A having the ith row sum ri and jth column sum c,, there exist diagonal matrices D1 and D with positive main diagonals such that D1AD2 has ith row sum r. and jth column sum cjHowever the known proofs are at best cumbersome. It is shown here that this result can be obtained by considering the minimum of a certain real-valued function of n positive variables. It has been shown originally by Sinkhorn and Knopp [81 and Brualdi, Parter, and Schneider [31 that if A is a nonnegative fully indecomposable matrix, i.e. A contains no s x (n s) zero submatrix, then there exists a doubly stochastic matrix of the form D 1AD2 where DI and D2 are diagonal matrices with positive main diagonals. Later Djokovic? [41, and independently, London [5], proved the same theorem by considering the minimum ofread more
Citations
More filters
Posted Content
Computational Optimal Transport
Gabriel Peyré,Marco Cuturi +1 more
TL;DR: This short book reviews OT with a bias toward numerical methods and their applications in data sciences, and sheds lights on the theoretical properties of OT that make it particularly useful for some of these applications.
Posted Content
Iterative Bregman Projections for Regularized Transportation Problems
TL;DR: It is shown that for many problems related to optimal transport, the set of linear constraints can be split in an intersection of a few simple constraints, for which the projections can be computed in closed form.
Proceedings Article
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm
TL;DR: In this article, two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size n, up to accuracy δ(n 2 ) were presented.
Journal ArticleDOI
Positive contraction mappings for classical and quantum Schrödinger systems
TL;DR: The classical Schrodinger bridge is characterised by an automorphism on the space of endpoints probability measures, which has been studied by Fortet, Beurling, and others as mentioned in this paper.
Posted Content
On the Complexity of Approximating Multimarginal Optimal Transport.
TL;DR: A first \textit{near-linear time} complexity bound guarantee for approximating the MOT problem and matches the best known complexity bound for the Sinkhorn algorithm in the classical OT setting when $m = 2$.
References
More filters
Journal ArticleDOI
Concerning nonnegative matrices and doubly stochastic matrices
Richard Sinkhorn,Paul Knopp +1 more
TL;DR: In this article, the condition for the convergence to a doubly stochastic limit of a sequence of matrices obtained from a nonnegative matrix A by alternately scaling the rows and columns of A was studied.
Journal ArticleDOI
The diagonal equivalence of a nonnegative matrix to a stochastic matrix
TL;DR: In this article, the authors used the Wielandt approach to prove Sinkhorn's theorem for the case when A is an irreducible matrix with a positive main diagonal.
Journal ArticleDOI
Convex sets of non-negative matrices
TL;DR: In this paper, Menon investigated the diagonal equivalence of a nonnegative matrix A to one with prescribed row and column sums and showed that this equivalence holds provided there exists at least one non-negative matrix with these rows and columns and with zeros in exactly the same positions A has zeros.
Journal ArticleDOI
The spectrum of a nonlinear operator associated with a matrix
M.V. Menon,Hans Schneider +1 more
TL;DR: In this article, the authors define the following notation and conventions: M > 0 if M is a matrix and all mij > 0; if M >0 but M # 0, and they call M a positive matrix, and in this case M strictly positive.
Journal ArticleDOI
Matrix Links, An Extremization Problem, and the Reduction of a Non-Negative Matrix to One With Prescribed Row and Column Sums
TL;DR: In this article, it was shown that two matrices will have the same pattern if the entry in any row or column is zero or not according as the corresponding entry of the other is zero, or not.