Scaling limit of Sinkhorn-rescaled Random Matrices via Stability of Static Schr\"odinger Bridges
Danny Duan, Hanbaek Lyu, William Powell

TL;DR
This paper studies the asymptotic behavior of large random matrices rescaled by the Sinkhorn algorithm, showing convergence to a continuous Schr"odinger bridge and developing a new stability theory for these bridges.
Contribution
It introduces a quantitative stability theory for static Schr"odinger bridges and applies it to analyze the scaling limits of Sinkhorn-rescaled random matrices.
Findings
Rescaled random matrices concentrate around their mean matrix.
Convergence to the continuous static Schr"odinger bridge as dimensions grow.
Established a fluctuation theory including bulk rigidity and CLT for Schr"odinger potentials.
Abstract
We analyze the asymptotic behavior and scaling limits of large random matrices rescaled via the Sinkhorn algorithm to match prescribed row and column margins. For a random matrix with independent sub-exponential entries, we show that its Sinkhorn rescaling concentrates around the rescaling of its mean matrix, both at the level of the Schr\"odinger potentials and as random measures on the unit square, with explicit non-asymptotic rates. As the dimensions grow, the rescaled random matrix converges to the continuous static Schr\"odinger bridge (SSB) determined by the limiting margins and reference density. Around this scaling limit we develop a fluctuation theory: bulk rigidity for the empirical spectral distribution of the associated sample covariance matrix, and a central limit theorem for the empirical Schr\"odinger potentials of the rescaled empirical mean. Our analysis is driven by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
