Large random matrices with given margins
Hanbaek Lyu, Sumit Mukherjee

TL;DR
This paper develops a framework for analyzing large random matrices with fixed margins, showing they can be approximated by simpler models, and proves several conjectures related to contingency tables and degree sequences.
Contribution
It introduces a transference principle for margin-conditioned matrices, resolves a 2011 conjecture on tame degree sequences, and provides algorithms for potential computation.
Findings
Approximation of complex matrices by independent entries with exponential tilting.
Convergence of potentials for sequences of tame margins.
Asymptotic distribution of entries and singular values confirming universality.
Abstract
We study large random matrices with i.i.d. entries conditioned to have prescribed row and column sums (margins), a problem connected to relative entropy minimization, Schr\"odinger bridges, contingency tables, and random graphs with given degree sequences. Our central result is a `transference principle': the complex margin-conditioned matrix can be closely approximated by a simpler matrix whose entries are independent and drawn from an exponential tilting of the original model. The tilt parameters are determined by the sum of two potentials. We establish phase diagrams for `tame margins', where these potentials are uniformly bounded. This framework resolves a 2011 conjecture by Chatterjee, Diaconis, and Sly on -tame degree sequences and generalizes a sharp phase transition in contingency tables obtained by Dittmer, Lyu, and Pak in 2020. For tame margins, we show that a…
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.
Taxonomy
TopicsRandom Matrices and Applications · advanced mathematical theories · Advanced Algebra and Geometry
