SearcharxivSearch

arXiv · 2609.08328

Radial Marchenko-Pastur laws: projection characterizations and rigidity

Abstract

Let \(R_p=\|x_p\|^2/p\Rightarrow \nu\) and \(p/N\to c\in(0,\infty)\). We prove that the radial quadratic-form condition (RQC), requiring energy in deterministic subspaces to follow the parent radius, is equivalent to the following spectral property: for one fixed \(\alpha\in(0,1)\), every deterministic rank-\(\lfloor \alpha p\rfloor\) projected covariance has empirical spectral distribution converging to \(\mu_{c\alpha,\nu}\). The radius law \(\nu\) may have arbitrary tails; no moment assumptions, conditional isotropy, or independence between radius and direction are required. We also show that the radius law can be recovered from the projected spectral limits when their common limit has finite second moment and subspaces of vanishing relative dimension carry vanishing normalized energy, again without moment assumptions on the original vectors. A finite-sample inverse estimate bounds quadratic-form defects by bounded tests of expected projected spectra. The converse argument combines angular symmetrization and fantope rigidity with a determinant comparison between radial column deletion and spectral trimming. A cancellation of the deleted radial factors makes the comparison error depend only on the deleted fraction, rather than on the magnitudes of the deleted radii.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaohui Xie. 2026-09-08. Radial Marchenko-Pastur laws: projection characterizations and rigidity. https://arxiv.org/abs/2609.08328

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