Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.14942

Large random matrices with given margins

Hanbaek Lyu·Sumit Mukherjee
View original source ↗Read source document ↗Export metadata ↓

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ödinger 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 generalized Sinkhorn algorithm can compute the potentials at a dimension-free exponential rate. Our limit theory further establishes that for a convergent sequence of tame margins, the potentials converge as fast as the margins converge. We apply this framework and obtain several key results for the conditioned matrix: The marginal distribution of any single entry is asymptotically an exponential tilting of the base measure, resolving a 2010 conjecture by Barvinok on contingency tables. The conditioned matrix concentrates in cut norm around a `typical table' (the expectation of the tilted model), which acts as a static Schrödinger bridge between the margins. The empirical singular value distribution of the rescaled matrix converges to an explicit law determined by the variance profile of the tilted model. In particular, we confirm the universality of the Marchenko-Pastur law for constant linear margins.

Explore related subjects

math.PRmath.COmath.STstat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hanbaek Lyu, Sumit Mukherjee. 2025-06-30. Large random matrices with given margins. https://arxiv.org/abs/2407.14942

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR↗
arXiv2026

The Fourth-Moment Theorem on Hilbert Spaces

In this work, we establish conditions ensuring convergence in distribution of a sequence admitting a Wiener-Itô chaos representation to a Gaussian measure on a separable Hilbert space. Our first main result shows that, assuming convergence of the associated covariance operators in the trace-class norm, a sequence lying in a fixed Wiener-Itô chaos converges in distribution if and only if its fourth weak moments converge to the corresponding Gaussian moments. For general sequences with infinite chaos expansions, we derive analogous sufficient conditions for convergence in distribution. A key ingredient in our approach is a Stein-Malliavin bound formulated with respect to a distance that metrizes weak convergence of probability measures on separable Hilbert spaces. The results are infinite-dimensional extensions of the classical real-valued Fourth-Moment Theorem of Nualart and Peccati [Ann. Probab. 33, 177-193 (2005)]. Our work builds upon the work by Bourguin and Campese [Electron. J. Probab. 25, 1-30 (2020)] who claimed a Fourth-Moment Theorem in separable Hilbert spaces. However, a recent work by Bassetti, Bourguin, Campese, and Peccati [Stat. Probab. Lett. 233, 110671, (2026)] showed that the distance employed in the former article does not metrize weak convergence of probability measures on separable Hilbert spaces. Consequently, the conditions stated in Bourguin and Campese are not sufficient to recover a valid Fourth-Moment Theorem in the Hilbert-space setting.

math.PR↗
arXiv2026

Collision types and times in interacting particle systems

We consider a system of stochastic interacting particles with general diffusion coefficient and drift functions and we study the types of collisions that arise in them. In particular, interactions between particles are inversely proportional to their separation, and the coupling function of interaction is also considered in great generality. Our main result shows that, under positivity and the stated variance compatibility conditions, no two distinct positive-root hyperplanes are reached simultaneously at a positive time. In type $A_{N-1}$, this excludes both collisions involving three or more particles and simultaneous collisions of disjoint pairs. In order to obtain our results we make use of symmetric polynomials in squared root projections; the degree of these polynomials indicates the type of collision, and by a locality argument we show that polynomials indicating a non-simple collision almost surely do not cancel. We use this result to obtain upper and lower bounds for the Hausdorff dimension of the set of collision times in terms of interaction-to-variance ratios. These bounds coincide in particular constant-ratio cases. Our results cover many of the most well-known particle systems, such as the Dyson model and Wishart processes and their extensions to non-constant diffusion coefficients and background drifts.

math.PR↗