Description
Title: Matrix Scaling and Applications
Abstract: When can the rows and columns of a non-negative square
matrix be scaled so that it becomes doubly stochastic? In 1964,
Sinkhorn proposed and analyzed a natural iterative procedure that
produces such a scaling when possible. In this talk, we will see this
procedure and see some algorithmic and (if time permits) combinatorial
applications.