## Abstract For block‐partitioned matrices of the __GI/M/__1 type, it has been shown by M. F. Neuts that the stationary probability vector, when it exists, has a matrix‐geometric form. We present here a new proof, which we believe to be the simplest available today.
Matrix scaling: A geometric proof of Sinkhorn's theorem
✍ Scribed by Alberto Borobia; Rafael Cantó
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 304 KB
- Volume
- 268
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
✦ Synopsis
Matrix sealing problems have been extensively studied since Sinkhorn established in 1964 the following result: Any positive square matrix of order n is diagonally equivalent to a unique doubly stochastic matrix of order n, and the diagonal nuttriees which take part in the equivalence are unique up to scalar factors. We present a new elementary proof of the existence part of Sinldlorn's theorem which is based on well-known geometrical interpretations of doubly stochastic matrices and left and right multiplication by diagonal matrices.
📜 SIMILAR VOLUMES
Hollmann, Ko rner, and Litsyn used generalized Steiner systems to prove that it is impossible to partition an n-cube into k Hamming spheres if 2<k<n+2. Furthermore, if k=n+2, they showed the only partition of the n-cube consists of a single sphere of radius n&2 and n+1 spheres of radius 0. We give a
Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo