Recently Tracy and Widom conjectured [math.CO/9904042] and Johansson proved [math.CO/9906120] that the expected shape λof the semi-standard tableau produced by a random word in k letters is asymptotically the spectrum of a random traceless k by k GUE matrix. In this article we give two arguments for this fact. In the first argument, we realize the random matrix itself as a quantum random variable on the space of random words, if this space is viewed as a quantum state space. In the second argument, we show that the distribution of λis asymptotically given by the usual local limit theorem, but the resulting Gaussian is disguised by an extra polynomial weight and by reflecting walls. Both arguments more generally apply to an arbitrary finite-dimensional representation V of an arbitrary simple Lie algebra g. In the original question, V is the defining representation of g = su(k).
We consider words $G_{i_1} \cdots G_{i_m}$ involving i.i.d. complex Ginibre matrices, and study tracial expressions of their eigenvalues and singular values. We show that the limit distribution of the squared singular values of every word of length $m$ is a Fuss-Catalan distribution with parameter $m+1$. This generalizes previous results concerning powers of a complex Ginibre matrix, and products of independent Ginibre matrices. In addition, we find other combinatorial parameters of the word that determine the second-order limits of the spectral statistics. For instance, the so-called coperiod…
In this paper we introduce a new combinatorial approach to analyze the trace of large powers of Wigner matrices. Our approach is motivated from the paper by \citet{sosh}. However the counting approach is different. We start with classical word sentence approach similar to \citet{AZ05} and take the motivation from \citet{sinaisosh}, \citet{sosh} and \citet{peche2009universality} to encode the words to objects similar to Dyck paths. To be precise the map takes a word to a Dyck path with some edges removed from it. Using this new counting we prove edge universality for large Wigner matrices with …
We consider a class of elliptic random matrices which generalize two classical ensembles from random matrix theory: Wigner matrices and random matrices with iid entries. In particular, we establish a central limit theorem for linear eigenvalue statistics of real elliptic random matrices under the assumption that the test functions are analytic. As a corollary, we extend the results of Rider and Silverstein to real iid random matrices.
We prove the Central Limit Theorem for linear statistics of the eigenvalues of band random matrices provided $\sqrt{n} \ll b_n \ll n$ and test functions are sufficiently smooth.
We study large Wigner random matrices in the case when the marginal distributions of matrix entries have heavy tails. We prove that the largest eigenvalues of such matrices have Poisson statistics.
We consider dynamically defined Hermitian matrices generated from orbits of the doubling map. We prove that their spectra fall into the GUE universality class from random matrix theory.
Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all linear combinations of subword statistics, and fully characterize their different orders of magnitude using diverse algebraic tools. Moreover, we establish the spectral decomposition of the space of word statistics of each order. We provide explicit formulas for the eigenvectors and eigenvalues of the covariance matrix of the multivariate distribution of thes…
We prove that the linear statistics of the eigenvalues of a Wigner matrix converge to a universal Gaussian process on all mesoscopic spectral scales, i.e. scales larger than the typical eigenvalue spacing and smaller than the global extent of the spectrum.
We prove a central limit theorem for the difference of linear eigenvalue statistics of a sample covariance matrix $\widetilde{W}$ and its minor $W$. We find that the fluctuation of this difference is much smaller than those of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of $\widetilde{W}$ and $W$. Our result identifies the fluctuation of the spatial derivative of the approximate Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar result for Wigner matrices, for sample covariance matrices the fluctuation may en…
Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of Kontsevich.
We consider two classical ensembles of the random matrix theory: the Wigner matrices and sample covariance matrices, and prove Central Limit Theorem for linear eigenvalue statistics under rather weak (comparing with results known before) conditions on the number of derivatives of the test functions and also on the number of the entries moments. Moreover, we develop a universal method which allows one to obtain automatically the bounds for the variance of differentiable test functions, if there is a bound for the variance of the trace of the resolvent of random matrix. The method is applicable …
Consider the product $X = X_{1}\cdots X_{m}$ of $m$ independent $n\times n$ iid random matrices. When $m$ is fixed and the dimension $n$ tends to infinity, we prove Gaussian limits for the centered linear spectral statistics of $X$ for analytic test functions. We show that the limiting variance is universal in the sense that it does not depend on $m$ (the number of factor matrices) or on the distribution of the entries of the matrices. The main result generalizes and improves upon previous limit statements for the linear spectral statistics of a single iid matrix by Rider and Silverstein as we…
We show Poisson statistics for random band matrices which diagonal entries have Gaussian components. These components are possibly as small as $n^{-\varepsilon}$. Particularly, our result is applicable for a band matrix cut from the GUE with the band width satisfying $w^{3.5}<<n$. A uniform upper bound of the averaged density of states (DOS) is obtained for complex deformed Gaussian band matrices with arbitrary $w$. A lower estimate of the DOS is also proven for arbitrary $w$ in a certain class of band matrices.
We analyze statistics for eigenvector entries of heavy-tailed random symmetric matrices (also called Lévy matrices) whose associated eigenvalues are sufficiently small. We show that the limiting law of any such entry is non-Gaussian, given by the product of a normal distribution with another random variable that depends on the location of the corresponding eigenvalue. Although the latter random variable is typically non-explicit, for the median eigenvector it is given by the inverse of a one-sided stable law. Moreover, we show that different entries of the same eigenvector are asymptotically i…
Let $F_N$ and $F$ be the empirical and limiting spectral distributions of an $N\times N$ Wigner matrix. The Cramér-von Mises (CvM) statistic is a classical goodness-of-fit statistic that characterizes the distance between $F_N$ and $F$ in $\ell^2$-norm. In this paper, we consider a mesoscopic approximation of the CvM statistic for Wigner matrices, and derive its limiting distribution. In the appendix, we also give the limiting distribution of the CvM statistic (without approximation) for the toy model CUE.
As suggested by Currie, we apply the probabilistic method to problems regarding pattern avoidance. Using techniques from analytic combinatorics, we calculate asymptotic pattern occurrence statistics and use them in conjunction with the probabilistic method to establish new results about the Ramsey theory of unavoidable patterns in the full word case (both nonabelian sense and abelian sense) and in the partial word case. Keywords: Combinatorics on words; Partial words; Unavoidable patterns; Abelian patterns; Probabilistic method; Analytic combinatorics; Ramsey theory.
We study linear eigenvalue statistics of band Hankel matrices with Brownian motion entries. We prove that, the centred, normalized linear eigenvalue statistics of band Hankel matrices obey a central limit theorem (CLT) type result. We also discuss the convergence of linear eigenvalue statistics of band Hankel matrices with independent entries for odd power monomials. Our method is based on trace formula, moment method and some results of process convergence.
In this paper, we consider the universality of the local eigenvalue statistics of random matrices. Our main result shows that these statistics are determined by the first four moments of the distribution of the entries. As a consequence, we derive the universality of eigenvalue gap distribution and $k$-point correlation and many other statistics (under some mild assumptions) for both Wigner Hermitian matrices and Wigner real symmetric matrices.
We prove uniform estimates for the expected value of averages of order statistics of matrices in terms of their largest entries. As an application, we obtain similar probabilistic estimates for $\ell_p$ norms via real interpolation.
A direct saddle-point analysis (without relying on any modular forms, identities or functional equations) is developed to establish the asymptotics of Fishburn matrices and a large number of other variants with a similar sum of-finite-product form for their (formal) general functions. In addition to solving some conjectures, the application of our saddle-point approach to the distributional aspects of statistics on Fishburn matrices is also examined with many new limit theorems characterized, representing the first of their kind for such structures.
This article focuses on linear eigenvalue statistics of Hankel matrices with independent entries. Using the convergence of moments we show that the linear eigenvalue statistics of Hankel matrices for odd degree monomials with degree greater than or equal to three does not converge in distribution to a Gaussian random variable. This result is a departure from the known results, Liu, Sun and Wang (2012), Kumar and Maurya (2022), of linear eigenvalue statistics of Hankel matrices for even degree monomial test functions, where the limits were Gaussian random variables.
We prove the Central Limit Theorem for finite-dimensional vectors of linear eigenvalue statistics of submatrices of Wigner random matrices under the assumption that test functions are sufficiently smooth. We connect the asymptotic covariance to a family of correlated Gaussian Free Fields.
We consider a Wigner matrix $A$ with entries tail decaying as $x^{-α}$ with $2<α<4$ for large $x$ and study fluctuations of linear statistics $N^{-1}\operatorname{Tr}φ(A)$. The behavior of such fluctuations has been understood for both heavy-tailed matrices (i.e. $α< 2$) and light-tailed matrices (i.e. $α> 4$). This paper fills in the gap of understanding for $2<α<4$. We find that while linear spectral statistics for heavy-tailed matrices have fluctuations of order $N^{-1/2}$ and those for light-tailed matrices have fluctuations of order $N^{-1}$, the linear spectral statistics for half-heavy-…
We consider random matrices that have invariance properties under the action of unitary groups (either a left-right invariance, or a conjugacy invariance), and we give formulas for moments in terms of functions of eigenvalues. Our main tool is the Weingarten calculus. As an application to statistics, we obtain new formulas for the pseudo inverse of Gaussian matrices and for the inverse of compound Wishart matrices.
We analyze the largest eigenvalue statistics of m-dependent heavy-tailed Wigner matrices as well as the associated sample covariance matrices having entry-wise regularly varying tail distributions with parameter $0<α<4$. Our analysis extends results in the previous literature for the corresponding random matrices with independent entries above the diagonal, by allowing for m-dependence between the entries of a given matrix. We prove that the limiting point process of extreme eigenvalues is a Poisson cluster process.
Motivated by the stochastic block model, we investigate a class of Wigner-type matrices with certain block structures, and establish a CLT for the corresponding linear spectral statistics via the large-deviation bounds from local law and the cumulant expansion formula. We apply the results to the stochastic block model. Specifically, a class of renormalized adjacency matrices will be block-Wigner-type matrices. Further, we show that for certain estimator of such renormalized adjacency matrices, which will be no longer Wigner-type but share long-range non-decaying weak correlations among the en…
In this paper we discuss the process convergence of the time dependent fluctuations of linear eigenvalue statistics of random circulant matrices with independent Brownian motion entries, as the dimension of the matrix tends to $\infty $. Our derivation is based on the trace formula of circulant matrix, method of moments and some combinatorial techniques.
This paper is the third chapter of three of the author's undergraduate thesis. In this paper, we study the convergence of local bulk statistics for linearized covariance matrices under Dyson's Brownian motion. We consider deterministic initial data $V$ approximate the Dyson Brownian motion for linearized covariance matrices by the Wigner flow. Using universality results for the Wigner flow, we deduce universality for the linearized covariance matrices. We deduce bulk universality of averaged bulk correlation functions for both biregular bipartite graphs and honest covariance matrices. We also …
We consider $N$ by $N$ deformed Wigner random matrices of the form $X_N=H_N+A_N$, where $H_N$ is a real symmetric or complex Hermitian Wigner matrix and $A_N$ is a deterministic real bounded diagonal matrix. We prove a universal Central Limit Theorem for the linear eigenvalue statistics of $X_N$ for all mesoscopic scales both in the spectral bulk and at regular edges where the global eigenvalue density vanishes as a square root. The method relies on the characteristic function method in [47], local laws for the Green function of $X_N$ in [3, 46, 51] and analytic subordination properties of the…
We prove optimal local law, bulk universality and non-trivial decay for the off-diagonal elements of the resolvent for a class of translation invariant Gaussian random matrix ensembles with correlated entries.
We give an upper bound on the total variation distance between the linear eigenvalue statistic, properly scaled and centred, of a random matrix with a variance profile and the standard Gaussian random variable. The second order Poincaré inequality type result is used to establish the bound. Using this bound we prove Central limit theorem for linear eigenvalue statistics of random matrices with different kind of variance profiles. We re-establish some existing results on fluctuations of linear eigenvalue statistics of some well known random matrix ensembles by choosing appropriate variance prof…
We prove a universal mesoscopic central limit theorem for linear eigenvalue statistics of a Wigner-type matrix inside the bulk of the spectrum with compactly supported twice continuously differentiable test functions. The main novel ingredient is an optimal local law for the two-point function $T(z,ζ)$ and a general class of related quantities involving two resolvents at nearby spectral parameters.
We prove that, for general test functions, the limiting behavior of the linear statistic of an independent entry random matrix is determined only by the first four moments of the entry distributions. This immediately generalizes the known central limit theorem for independent entry matrices with complex normal entries. We also establish two central limit theorems for matrices with real normal entries, considering separately functions supported exclusively on and exclusively away from the real line. In contrast to previously obtained results in this area, we do not impose analyticity on test fu…
We consider large-dimensional Hermitian or symmetric random matrices of the form $W=M+\vartheta V$ where $M$ is a Wigner matrix and $V$ is a real diagonal matrix whose entries are independent of $M$. For a large class of diagonal matrices $V$, we prove that the fluctuations of linear spectral statistics of $W$ for $C^{2}_{c}$ test function can be decomposed into that of $M$ and of $V$, and that each of those weakly converges to a Gaussian distribution. We also calculate the formulae for the means and variances of the limiting distributions.
Given two sequences over a finite alphabet $\mathcal{L}$, the $D_2$ statistic is the number of $m$-letter word matches between the two sequences. This statistic is used in bioinformatics for expressed sequence tag database searches. Here we study a generalization of the $D_2$ statistic in the context of DNA sequences, under the assumption of strand symmetric Bernoulli text. For $k<m$, we look at the count of $m$-letter word matches with up to $k$ mismatches. For this statistic, we compute the expectation, give upper and lower bounds for the variance and prove its distribution is asymptotically…
We compute quantitative bounds for measuring the discrepancy between the distribution of two min-max statistics involving either pairs of Gaussian random matrices, or one Gaussian and one Gaussian-subordinated random matrix. In the fully Gaussian setup, our approach allows us to recover quantitative versions of well-known inequalities by Gordon (1985, 1987, 1992), thus generalising the quantitative version of the Sudakov-Fernique inequality deduced in Chatterjee (2005). On the other hand, the Gaussian-subordinated case yields generalizations of estimates by Chernozhukov et al. (2015) and Koike…
The paper proves several limit theorems for linear eigenvalue statistics of overlapping Wigner and sample covariance matrices. It is shown that the covariance of the limiting multivariate Gaussian distribution is diagonalized by choosing the Chebyshev polynomials of the first kind as the basis for the test function space. The covariance of linear statistics for the Chebyshev polynomials of sufficiently high degree depends only on the first two moments of the matrix entries. Proofs are based on a graph-theoretic interpretation of the Chebyshev linear statistics as sums over non-backtracking cyc…
