We study the asymptotic behavior of permanents of $n \times n$ random matrices $A$ with positive entries. We assume that $A$ has either i.i.d. entries or is a symmetric matrix with the i.i.d. upper triangle. Under the assumption that elements have power law decaying tails, we prove a strong law of large numbers for $\log \perm A$. We calculate the values of the limit $\lim_{n \to \infty}\frac{\log \perm A}{n \log n}$ in terms of the exponent of the power law distribution decay, and observe a first order phase transition in the limit as the mean becomes infinite. The methods extend to a wide class of rectangular matrices. It is also shown that, in finite mean regime, the limiting behavior holds uniformly over all submatrices of linear size.
We explore some properties of a recent representation of permanental vectors which expresses them as sums of independent vectors with components that are independent gamma random variables.
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-…
This paper investigates an upper bound of the operator norm for sub-Gaussian tailed random matrices. A lot of attention has been put on uniformly bounded sub-Gaussian tailed random matrices with independent coefficients. However, little has been done for sub-Gaussian tailed random matrices whose matrix coefficients variance are not equal or for matrix for which coefficients are not independent. This is precisely the subject of this paper. After proving that random matrices with uniform sub-Gaussian tailed independent coefficients satisfy the Tracy Widom bound, that is, their matrix operator no…
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.
We study the statistics of the largest eigenvalues of real symmetric and sample covariance matrices when the entries are heavy tailed. Extending the result obtained by Soshnikov in \cite{Sos1}, we prove that, in the absence of the fourth moment, the top eigenvalues behave, in the limit, as the largest entries of the matrix.
Bobkov (J. Theoret. Probab. 18(2) (2005) 399-412) investigated an approximate de Finetti representation for probability measures, on product measurable spaces, which are symmetric under permutations of coordinates. One of the main results of that paper was an explicit approximation bound for permanents of complex rectangular matrices, which was shown by a somewhat complicated induction argument. In this paper, we indicate how to avoid the induction argument using an (asymptotic) expansion. Our approach makes it possible to give new explicit higher order approximation bounds for such permanents…
This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with dependent entries converge to the Frechét distribution after appropriate scaling. This extends a seminal result of Soshnikov(2004) when the tail index is strictly less than one.
Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In this paper we consider constrained~\(n \times n\) random matrices where each row has a deterministic number~\(r = r(n)\) zero entries and the rest of the entries are independent random variables that are positive almost surely. The positions of the zeros within each row are also random and we establish sufficient conditions for the existence of a weak law of la…
We show central limit theorems (CLT) for the Stieltjes transforms or more general analytic functions of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of $α$-stable laws and entries with moments exploding with the dimension, as in the adjacency matrices of Erdös-Rényi graphs. For the second model, we also prove a central limit theorem of the moments of its empirical eigenvalues distribution. The limit laws are Gaussian, but unlike to the case of standard Wigner matrices, the normalization is the one of the classical CLT for independent r…
Let A_n=(a_{ij})_{i,j=1}^n be an n\times n positive matrix with entries in [a,b], 0<a\le b. Let X_n=(\sqrta_{ij}x_{ij})_{i,j=1}^n be a random matrix, where {x_{ij}} are i.i.d. N(0,1) random variables. We show that for large n, \det (X_n^TX_n) concentrates sharply at the permanent of A_n, in the sense that n^{-1}\log (\det(X_n^TX_n)/perA_n)\to_{n\to\infty}0 in probability.
Consider an n x n Hermitian random matrix with, above the diagonal, independent entries with alpha-stable symmetric distribution and 0 < alpha < 2. We establish new bounds on the rate of convergence of the empirical spectral distribution of this random matrix as n goes to infinity. When 1 < alpha < 2 we give vanishing bounds on the Lp-norm of the eigenvectors normalized to have unit L2-norm goes to 0. On the contrary, when 0 < alpha < 2/3, we prove that these eigenvectors are localized.
We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.
In this paper we analyze the covariance kernel of the Gaussian process that arises as the limit of fluctuations of linear spectral statistics for Wigner matrices with a few moments. More precisely, the process we study here corresponds to Hermitian matrices with independent entries that have $α$ moments for $2<α< 4$. We obtain a closed form $α$-dependent expression for the covariance of the limiting process resulting from fluctuations of the Stieltjes transform by explicitly integrating the known double Laplace transform integral formula obtained in the literature. We then express the covarian…
We study the statistics of the largest eigenvalues of $p \times p$ sample covariance matrices $Σ_{p,n} = M_{p,n}M_{p,n}^{*}$ when the entries of the $p \times n$ matrix $M_{p,n}$ are sparse and have a distribution with tail $t^{-α}$, $α>0$. On average the number of nonzero entries of $M_{p,n}$ is of order $n^{μ+1}$, $0 \leq μ\leq 1$. We prove that in the large $n$ limit, the largest eigenvalues are Poissonian if $α<2(1+μ^{-1})$ and converge to a constant in the case $α>2(1+μ^{-1})$. We also extend the results of Benaych-Georges and Peche [7] in the Hermitian case, removing restrictions on the …
We consider some random band matrices with band-width $N^μ$ whose entries are independent random variables with distribution tail in $x^{-α}$. We consider the largest eigenvalues and the associated eigenvectors and prove the following phase transition. On the one hand, when $α\textless{}2(1+μ^{-1})$, the largest eigenvalues have order $N^{(1+μ)/α}$, are asymptotically distributed as a Poisson process and their associated eigenvectors are essentially carried by two coordinates (this phenomenon has already been remarked by Soshnikov for full matrices with heavy tailed entries,i.e. when $α\textle…
We consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $α$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by $U=[u_{ij}]$ the eigenvectors matrix (corresponding to increasing eigenvalues) and prove that the bivariate process $$B^n_{s,t}:=n^{-1/2}\sum_{1\le i\le ns, 1\le j\le nt}(|u_{ij}|^2 -n^{-1}),$$ indexed by $s,t\in [0,1]$, converges in law to a non trivial Gaussian process. An interesting part of this result is the $n^{-1/2}$ rescaling, proving that from this point of view, …
We form a sequence of oblong matrices by evaluating an integrable vector-valued function along the orbit of an ergodic dynamical system. We obtain an almost sure asymptotic result for the permanents of those matrices. We also give an application to symmetric means.
We present estimates on the small singular values of a class of matrices with independent Gaussian entries and inhomogeneous variance profile, satisfying a broad-connectedness condition. Using these estimates and concentration of measure for the spectrum of Gaussian matrices with independent entries, we prove that for a large class of graphs satisfying an appropriate expansion property, the Barvinok--Godsil-Gutman estimator for the permanent achieves sub-exponential errors with high probability.
We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{γ+1}\simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a $c^n$ approximation of the permanent. We further show that this factor is asymptotically tight by constructing a family of positive semidefinite matrices.
Let $A=(a_{ij})$ be an $n\times n$ random matrix with i.i.d. entries such that $\mathbb{E} a_{11} = 0$ and $\mathbb{E} {a_{11}}^2 = 1$. We prove that for any $δ>0$ there is $L>0$ depending only on $δ$, and a subset $\mathcal{N}$ of $B_2^n$ of cardinality at most $\exp(δn)$ such that with probability very close to one we have $$A(B_2^n)\subset \bigcup_{y\in A(\mathcal{N})}\bigl(y+L\sqrt{n}B_2^n\bigr).$$ As an application, we show that for some $L'>0$ and $u\in[0,1)$ depending only on the distribution law of $a_{11}$, the smallest singular value $s_n$ of the matrix $A$ satisfies $\mathbb{P}\{s_n…
Let $p>2$, $B\geq 1$, $N\geq n$ and let $X$ be a centered $n$-dimensional random vector with the identity covariance matrix such that $\sup\limits_{a\in S^{n-1}}{\mathrm E}|\langle X,a\rangle|^p\leq B$. Further, let $X_1,X_2,\dots,X_N$ be independent copies of $X$, and $Σ_N:=\frac{1}{N}\sum_{i=1}^N X_i {X_i}^T$ be the sample covariance matrix. We prove that $$K^{-1}\|Σ_N-I_n\|_{2\to 2}\leq\frac{1}{N}\max\limits_{i\leq N}\|X_i\|^2 +\Bigl(\frac{n}{N}\Bigr)^{1-2/p}\log^4\frac{N}{n}+\Bigl(\frac{n}{N}\Bigr)^{1-2/\min(p,4)}$$ with probability at least $1-\frac{1}{n}$, where $K>0$ depends only on $B$…
The theory of random matrices contains many central limit theorems. We have central limit theorems for eigenvalues statistics, for the log-determinant and log-permanent, for limiting distribution of individual eigenvalues in the bulk, and many others. In this notes, we discuss the following problem: Is it possible to prove the law of the iterated logarithm? We illustrate this possibility by showing that this is indeed the case for the log of the permanent of random Bernoulli matrices and pose open questions concerning several other matrix parameters.
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided for several random matrix ensembles. When compared with the corresponding formulae for characteristic polynomials, our results show both striking similarities and interesting differences. Based on these findings, we conjecture the asymptotic forms of the density of permanental roots in the complex plane for Gaussian ensembles as well as for the Circular Unita…
One-rank perturbations of Wigner matrices have been closely studied: let $P=\frac{1}{\sqrt{n}}A+θvv^T$ with $A=(a_{ij})_{1 \leq i,j \leq n} \in \mathbb{R}^{n \times n}$ symmetric, $(a_{ij})_{1 \leq i \leq j \leq n}$ i.i.d. with centered standard normal distributions, and $θ>0, v \in \mathbb{S}^{n-1}.$ It is well known $λ_1(P),$ the largest eigenvalue of $P,$ has a phase transition at $θ_0=1:$ when $θ\leq 1,$ $λ_1(P) \xrightarrow[]{a.s.} 2,$ whereas for $θ> 1,$ $λ_1(P) \xrightarrow[]{a.s.} θ+θ^{-1}.$ Under more general conditions, the limiting behavior of $λ_1(P),$ appropriately normalized, has…
Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, "anti-concentration" of this distribution is an unproven input for the proof of hardness of the task of boson-sampling. We study permanents of random i.i.d. complex Gaussian matrices, and more broadly, submatrices of random unitary matrices. Using a hybrid representation-theoretic and combinatorial approach, we prove strong lower bounds for all moments of the permanent distribution. We provide substantial evidence that our bounds are close to being tight a…
We study a new random matrix ensemble $X$ which is constructed by an application of a two dimensional linear filter to a matrix of iid random variables with infinite fourth moments. Our result gives asymptotic lower and upper bounds for the spectral norm of the (centered) sample covariance matrix $XX^\T$ when the number of columns as well es the number of rows of $X$ tend to infinity.
We prove that the eigenvectors associated to small enough eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to infinity. The delocalization is measured thanks to a simple criterion related to the inverse participation ratio which computes an average ratio of L4 and L2-norms of vectors. In contrast, as a consequence of a previous result, for random matrices with sufficiently heavy tails, the eigenvectors associated to large enough eigenvalues are localized according to the same criterion. The proof is based on …
Staircase phase transitions for the largest eigenvalue of heavy-tailed sample correlation matrices
Harbin Institute of Technology（哈尔滨工业大学）；Nanyang Technological University（南洋理工大学）；Jinan University（暨南大学）；National University of Singapore（新加坡国立大学）；Changchun University of Science and Technology（长春理工大学）
We study the asymptotic behavior of the appropriately scaled and possibly perturbed spectral measure $μ$ of large random real symmetric matrices with heavy tailed entries. Specifically, consider the N by N symmetric matrix $Y_N^σ$ whose (i,j) entry is $σ(i/N,j/N)X_{ij}$ where $(X_{ij}, 0<i<j+1<\infty)$ is an infinite array of i.i.d real variables with common distribution in the domain of attraction of an $α$-stable law, $0<α<2$, and $σ$ is a deterministic function. For a random diagonal $D_N$ independent of $Y_N^σ$ and with appropriate rescaling $a_N$, we prove that the distribution $μ$ of $a_…
An elliptic random matrix $X$ is a square matrix whose $(i,j)$-entry $X_{ij}$ is independent of the rest of the entries except possibly $X_{ji}$. Elliptic random matrices generalize Wigner matrices and non-Hermitian random matrices with independent entries. When the entries of an elliptic random matrix have mean zero and unit variance, the empirical spectral distribution is known to converge to the uniform distribution on the interior of an ellipse determined by the covariance of the mirrored entries. We consider elliptic random matrices whose entries fail to have two finite moments. Our main …
Let (X_{jk})_{j,k>=1} be i.i.d. complex random variables such that |X_{jk}| is in the domain of attraction of an alpha-stable law, with 0< alpha <2. Our main result is a heavy tailed counterpart of Girko's circular law. Namely, under some additional smoothness assumptions on the law of X_{jk}, we prove that there exists a deterministic sequence a_n ~ n^{1/alpha} and a probability measure mu_alpha on C depending only on alpha such that with probability one, the empirical distribution of the eigenvalues of the rescaled matrix a_n^{-1} (X_{jk})_{1<=j,k<=n} converges weakly to mu_alpha as n tends …
Let $Γ$ be an $N\times n$ random matrix with independent entries and such that in each row entries are i.i.d. Assume also that the entries are symmetric, have unit variances, and satisfy a small ball probabilistic estimate uniformly. We investigate properties of the corresponding random polytope $Γ^* B_1^N$ in $\mathbb{R}$ (the absolute convex hull of rows of $Γ$). In particular, we show that $$ ΓB_1^N \supset b^{-1} \left( B_{\infty}^n \cap \sqrt{\ln (N/n)}\, B_2^n \right). $$ where $b$ depends only on parameters in small ball inequality. This extends results of \cite{LPRT} and recent results…
Let $X_N$ be an $N\ts N$ random symmetric matrix with independent equidistributed entries. If the law $P$ of the entries has a finite second moment, it was shown by Wigner \cite{wigner} that the empirical distribution of the eigenvalues of $X_N$, once renormalized by $\sqrt{N}$, converges almost surely and in expectation to the so-called semicircular distribution as $N$ goes to infinity. In this paper we study the same question when $P$ is in the domain of attraction of an $α$-stable law. We prove that if we renormalize the eigenvalues by a constant $a_N$ of order $N^{\frac{1}α}$, the correspo…
For a large class of random matrices $A$ with i.i.d. entries we show that the $\ell_1$-quotient property holds with probability exponentially close to 1. In contrast to previous results, our analysis does not require concentration of the entrywise distributions. We provide a unified proof that recovers corresponding previous results for (sub-)Gaussian and Weibull distributions. Our findings generalize known results on the geometry of random polytopes, providing lower bounds on the size of the largest Euclidean ball contained in the centrally symmetric polytope spanned by the columns of $A$. At…
Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the permanent of $M_{n}$ has magnitude $n^{n/2+o(n)}$ with probability $1-o(1)$. Our result can also be extended to more general models of random matrices.
In this paper we study the joint distributional convergence of the largest eigenvalues of the sample covariance matrix of a $p$-dimensional time series with iid entries when $p$ converges to infinity together with the sample size $n$. We consider only heavy-tailed time series in the sense that the entries satisfy some regular variation condition which ensures that their fourth moment is infinite. In this case, Soshnikov [31, 32] and Auffinger et al. [2] proved the weak convergence of the point processes of the normalized eigenvalues of the sample covariance matrix towards an inhomogeneous Pois…
We provide some asymptotic theory for the largest eigenvalues of a sample covariance matrix of a p-dimensional time series where the dimension p = p_n converges to infinity when the sample size n increases. We give a short overview of the literature on the topic both in the light- and heavy-tailed cases when the data have finite (infinite) fourth moment, respectively. Our main focus is on the heavytailed case. In this case, one has a theory for the point process of the normalized eigenvalues of the sample covariance matrix in the iid case but also when rows and columns of the data are linearly…
We are concerned with the small ball behavior of the smallest singular value of random matrices. Often, establishing such results involves, in some capacity, a discretization of the unit sphere. This requires bounds on the norm of the matrix, and the latter bounds require strong assumptions on the distribution of the entries, such as bounded fourth moments (for a weak estimate), sub-gaussian tails (for a strong estimate), and structural assumptions such as mean zero and variance one. Recently, Rebrova and Tikhomirov developed a discretization procedure which does not rely on strong tail assump…
We study heavy-tailed Hermitian random matrices that are unitarily invariant. The invariance implies that the eigenvalue and eigenvector statistics are decoupled. The motivating question has been whether a freely stable random matrix has stable eigenvalue statistics for the largest eigenvalues in the tail. We investigate this question through the use of both numerical and analytical means, the latter of which makes use of the supersymmetry method. A surprising behaviour is uncovered in that a freely stable random matrix does not necessarily yield stable statistics and if it does then it might …
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $Å$. The monomial expansion of the symmetrized determinant is obtained from the standard expansion of the commutative determinant by averaging the products of entries of the matrix in all possible orders. We show that for any fixed finite-dimensional associative algebra $Å$, the symmetrized determinant of an $n\times n$ matrix with the entries in $Å$ can be computed in polynomial in $n$ time (the degree of the polynomial is linear in the dimension of $Å$)…
Consider a $p$-dimensional population ${\mathbf x} \in\mathbb{R}^p$ with iid coordinates in the domain of attraction of a stable distribution with index $α\in (0,2)$. Since the variance of ${\mathbf x}$ is infinite, the sample covariance matrix ${\mathbf S}_n=n^{-1}\sum_{i=1}^n {{\mathbf x}_i}{\mathbf x}'_i$ based on a sample ${\mathbf x}_1,\ldots,{\mathbf x}_n$ from the population is not well behaved and it is of interest to use instead the sample correlation matrix ${\mathbf R}_n= \{\operatorname{diag}({\mathbf S}_n)\}^{-1/2}\, {\mathbf S}_n \{\operatorname{diag}({\mathbf S}_n)\}^{-1/2}$. Th…
The recovery of signals that are sparse not in a basis, but rather sparse with respect to an over-complete dictionary is one of the most flexible settings in the field of compressed sensing with numerous applications. As in the standard compressed sensing setting, it is possible that the signal can be reconstructed efficiently from few, linear measurements, for example by the so-called $\ell_1$-synthesis method. However, it has been less well-understood which measurement matrices provably work for this setting. Whereas in the standard setting, it has been shown that even certain heavy-tailed m…
