SearcharxivSearch

arXiv · 2608.12151

The Average Singular Value of a Real Square Gaussian Random Matrix Strictly Increases with Dimension

Abstract

We settle the real half of a conjecture of Bandeira, Kennedy and Singer on the dimension dependence of the Gaussian constant governing the little Grothendieck problem over the orthogonal group. For an $N\times N$ standard real Gaussian matrix $G_N$, the average singular value $\alpha_{\mathbb R}(N)=N^{-3/2}\,\mathbb E\|G_N\|_*$ satisfies the quantitative estimate \[ \alpha_{\mathbb R}(N+1)-\alpha_{\mathbb R}(N)>\frac{1}{1000N^2}, \qquad N\ge1. \] Thus, the real constants increase strictly to the Marchenko--Pastur limit $8/(3\pi)$. The proof is finite-dimensional and exposes a mechanism not visible in the limiting spectral law. We decompose the Laguerre-orthogonal mean into its Laguerre-unitary counterpart and an explicit correction, then complete the resulting finite Laguerre sums to infinite diagonal tails. A bivariate generating function yields a positive diagonal kernel with a dimension-monotone remainder. This puts consecutive orthogonal corrections in common positive coordinates, where the nearest diagonal alone supplies an $N^{-2}$ reserve that dominates the unitary one-step term. The required unitary estimate is derived directly from Abreu's recurrence, and the first five dimensions are handled by exact closed forms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ondrej Hutník. 2026-08-12. The Average Singular Value of a Real Square Gaussian Random Matrix Strictly Increases with Dimension. https://arxiv.org/abs/2608.12151

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR