Tracy Widom law for sample covariance matrices under quadratic form concentration

Auteurs : Guangchen Chen, Xing Lyu

Soumis à arXiv le 30 Oct. 2026
Licence : CC0 1.0
Résumé scientifique

We study sample covariance matrices formed from i.i.d., centered, isotropic random vectors $q_1, \dots, q_N \in \mathbb{R}^M$, whose coordinates are allowed to be dependent. We assume the random vectors satisfy a concentration bound for their quadratic forms $q_i^T A q_i$. Under this assumption, we establish edge universality and obtain the Tracy--Widom law for the largest eigenvalue of the sample covariance matrix after appropriate centering and scaling. In particular, our result removes the unconditionality assumption in existing edge universality results for log-concave ensembles~\cite{BX}, resolving the question that originally motivated our work. The concentration assumption also allows us to extend the result beyond the log-concave class.

Les articles autour de lui, par date et par proximité

Plus haut, c’est plus proche de cet article ; à gauche, c’est plus ancien. Les traits relient les articles proches entre eux : les groupes de traits sont des sous-thèmes. Sélectionnez un point pour voir pourquoi il est là. Retour au résumé de cet article

Les articles les plus proches Les travaux antérieurs sur lesquels il s’appuie Les articles qui le citent

Les articles autour de celui-ci

Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.

Les articles les plus proches

  1. Proche Contexte plus large
    Matrix anti-concentration inequalities with applications
    Zipei Nie · 2021 · Probability · cité 22 fois · Résumé IA disponible

    Matrix anti-concentration inequalities borne sur les valeurs singulières de sommes de matrices aléatoires, plutôt que sur la loi de Tracy–Widom des covariances.

    Résumé scientifique

    We provide a polynomial lower bound on the minimum singular value of an $m\times m$ random matrix $M$ with jointly Gaussian entries, under a polynomial bound on the matrix norm and a global small-ball probability bound $$\inf_{x,y\in S^{m-1}}\mathbb{P}\left(\left|x^* M y\right|>m^{-O(1)}\right)\ge \frac{1}{2}.$$ With the additional assumption that $M$ is self-adjoint, the global small-ball probability bound can be replaced with a weaker version. We establish two matrix anti-concentration inequalities, which lower bound the minimum singular values of the sum of independent positive semidefinite self-adjoint matrices and the linear combination of independent random matrices with independent Ga…

  2. Proche Contexte plus large
    On the method of typical bounded differences
    Lutz Warnke · 2012 · Combinator. Probab. Comp. 25 (2016) 269-299 · cité 99 fois · Résumé IA disponible

    La méthode des différences bornées établit la concentration de fonctions de variables indépendantes, tandis que l’article étudie la concentration de formes quadratiques.

    Résumé scientifique

    Concentration inequalities are fundamental tools in probabilistic combinatorics and theoretical computer science for proving that random functions are near their means. Of particular importance is the case where f(X) is a function of independent random variables X=(X_1, ..., X_n). Here the well known bounded differences inequality (also called McDiarmid's or Hoeffding-Azuma inequality) establishes sharp concentration if the function f does not depend too much on any of the variables. One attractive feature is that it relies on a very simple Lipschitz condition (L): it suffices to show that |f(X)-f(X')| \leq c_k whenever X,X' differ only in X_k. While this is easy to check, the main disadvant…

  3. Proche Contexte plus large
    Restricted Maximum of Non-Intersecting Brownian Bridges
    Yamit Yalanda, Nicolás Zalduendo · 2023 · Probability · Résumé IA disponible

    Les ponts brownien non intersectants relient un maximum de trajectoire aux lois de Tracy–Widom, contrairement à l’étude des valeurs propres de covariance.

    Résumé scientifique

    Consider a system of $N$ non-intersecting Brownian bridges in $[0,1]$, and let $\mathcal M_N(p)$ be the maximal height attained by the top path in the interval $[0,p]$, $p\in[0,1]$. It is known that, under a suitable rescaling, the distribution of $\mathcal M_N(p)$ converges, as $N\to\infty$, to a one-parameter family of distributions interpolating between the Tracy-Widom distributions for the Gaussian Orthogonal and Unitary Ensembles (corresponding, respectively, to $p\to1$ and $p\to0$). It is also known that, for fixed $N$, $\mathcal M_N(1)$ is distributed as the top eigenvalue of a random matrix drawn from the Laguerre Orthogonal Ensemble. Here we show a version of these results for $\mat…

  4. Apparenté Contexte plus large
    An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
    Matthew Kwan, Lisa Sauermann · 2019 · Combinatorics · cité 7 fois · Résumé IA disponible

    Le problème de Littlewood–Offord caractérise la concentration d’un polynôme quadratique de Bernoulli, et non les fluctuations spectrales d’une covariance.

    Résumé scientifique

    Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem, which asks the same question for linear polynomials. As in the linear case, it is known that the point probabilities of $f$ can be as large as about $1/\sqrt{n}$, but still poorly understood is the "inverse" question of characterising the algebraic and arithmetic features $f$ must have if it has point probabilities comparable to this bound. In this paper we prove some results of an algebraic flavour, showing that if $f$ has point probabilities much larger…

  5. Apparenté Contexte plus large
    Almost sure convergence of products of $2\times2$ nonnegative matrices
    Alain Thomas · 2013 · Probability · preprint, non relu par les pairs · Résumé IA disponible

    Les produits de matrices non négatives sont étudiés via leurs exposants de Lyapunov, sans porter sur les valeurs propres extrêmes de covariance.

    Résumé scientifique

    We study the almost sure convergence of the normalized columns in an infinite product of nonnegative matrices, and the almost sure rank one property of its limit points. Given a probability on the set of $2\times2$ nonnegative matrices, with finite support $\mathcal A=\{A(0),\dots,A(s-1)\}$, and assuming that at least one of the $A(k)$ is not diagonal, the normalized columns of the product matrix $P_n=A(\omega_1)\dots A(\omega_n)$ converge almost surely (for the product probability) with an exponential rate of convergence if and only if the Lyapunov exponents are almost surely distinct. If this condition is satisfied, given a nonnegative column vector $V$ the column vector $\frac{P_nV}{\Vert…

  6. Apparenté Contexte plus large
    Universal Constraints for Conformal Line Defects
    Barak Gabai, Amit Sever, De-liang Zhong · 2025 · High Energy Physics - Theory · cité 12 fois · Résumé IA disponible

    Les contraintes sur les corrélateurs de défauts conformes relèvent de la théorie conforme, sans lien décrit avec les matrices de covariance.

    Résumé scientifique

    We present a novel framework for deriving integral constraints for correlators on conformal line defects. These constraints emerge from the non-linearly realized ambient-space conformal symmetry. To validate our approach, we examine several examples and compare them against existing data for the four-point function of the displacement operator. Additionally, we provide a few new predictions that extend the current understanding of these correlators.

  7. Apparenté Contexte plus large
    On the smoothed analysis of the smallest singular value with discrete noise
    Vishesh Jain, Ashwin Sah, Mehtaab Sawhney · 2020 · Probability · cité 12 fois · Résumé IA disponible

    L’analyse lissée borne la plus petite valeur singulière d’une matrice bruitée, tandis que l’article porte sur la plus grande valeur propre d’une covariance.

    Résumé scientifique

    Let $A$ be an $n\times n$ real matrix, and let $M$ be an $n\times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$. We make two contributions to the study of $s_n(A+M)$, the smallest singular value of $A+M$. (1) We show that for all $\epsilon \geq 0$, $$\mathbb{P}[s_n(A + M) \leq \epsilon] = O(\epsilon \sqrt{n}) + 2e^{-\Omega(n)},$$ provided only that $A$ has $\Omega (n)$ singular values which are $O(\sqrt{n})$. This extends a well-known result of Rudelson and Vershynin, which requires all singular values of $A$ to be $O(\sqrt{n})$. (2) We show that any bound of the form $$\sup_{\|{A}\|\leq n^{C_1}}\mathbb{P}[s_n(A+M)\leq n^{-C_3}] \leq n^…

  8. Apparenté Contexte plus large
    The Gauss-Bonnet Theorem for the noncommutative two torus
    Alain Connes, Paula Tretkoff · 2009 · Quantum Algebra · preprint, non relu par les pairs · cité 126 fois · Résumé IA disponible

    Le théorème de Gauss–Bonnet non commutatif concerne le Laplacien d’un tore, sans rapport décrit avec les lois spectrales de covariance.

    Résumé scientifique

    In this paper we show that the value at zero of the zeta function of the Laplacian on the non-commutative two torus, endowed with its canonical conformal structure, is independent of the choice of the volume element (Weyl factor) given by a (non-unimodular) state. We had obtained, in the late eighties, in an unpublished computation, a general formula for this value at zero involving modified logarithms of the modular operator of the state. We give here the detailed computation and prove that the result is independent of the Weyl factor as in the classical case, thus proving the analogue of the Gauss-Bonnet theorem for the noncommutative two torus.

Comment ces articles sont-ils trouvés ?

Nous comparons le titre et le résumé de cet article avec ceux de tous les articles résumés sur ce site, et avec les articles que Semantic Scholar recommande, ceux qu’il cite et ceux qui le citent (pour un article très cité, ses citations les plus récentes et, depuis OpenAlex, les plus citées). Parmi les travaux antérieurs et les suites, les articles qui s’utilisent en profondeur, une méthode qu’il utilise et les suites très citées remontent un peu. Les niveaux (très proche, proche, apparenté) viennent de la similarité des textes, pas d’un jugement de qualité ; * signale un article sans résumé, comparé par son titre. La phrase sous un article est écrite par une IA à partir des deux résumés : vérifiez-la dans les articles. Un article jugé hors sujet par trois lecteurs quitte la liste.

Mis à jour le 2 novembre 2026.