Related papers: Delocalization at small energy for heavy-tailed ra…

We study the hierarchical analogue of power-law random band matrices, a symmetric ensemble of random matrices with independent entries whose variances decay exponentially in the metric induced by the tree topology on $\mathbb{N}$. We map…

We consider random hermitian matrices in which distant above-diagonal entries are independent but nearby entries may be correlated. We find the limit of the empirical distribution of eigenvalues by combinatorial methods. We also prove that…

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…

Although the spectral properties of random graphs have been a long-standing focus of network theory, the properties of right eigenvectors of directed graphs have so far eluded an exact analytic treatment. We present a general theory for the…

Directed last passage percolation models on the plane, where one studies the weight as well as the geometry of optimizing paths (called polymers) in a field of i.i.d. weights, are paradigm examples of models in the KPZ universality class.…

Unraveling the reasons behind the remarkable success and exceptional generalization capabilities of deep neural networks presents a formidable challenge. Recent insights from random matrix theory, specifically those concerning the spectral…

We show that correlation matrices with particular average and variance of the correlation coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for the largest eigenvalue and the…

Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with…

When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…

We generalize our former localization result about the principal Dirichlet eigenvector of the i.i.d. heavy-tailed random conductance Laplacian to the first $k$ eigenvectors. We overcome the complication that the higher eigenvectors have…

Consider a deterministic self-adjoint matrix X_n with spectral measure converging to a compactly supported probability measure, the largest and smallest eigenvalues converging to the edges of the limiting measure. We perturb this matrix by…

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…

In this paper, we show that the largest and smallest eigenvalues of a sample correlation matrix stemming from $n$ independent observations of a $p$-dimensional time series with iid components converge almost surely to $(1+\sqrt{\gamma})^2$…

The density of complex eigenvalues of random asymmetric $N\times N$ matrices is found in the large-$N$ limit. The matrices are of the form $H_0+A$ where $A$ is a matrix of $N^2$ independent, identically distributed random variables with…

In this paper, we analyze the large n-limit for random matrix with external source with three distinct eigenvalues. And we confine ourselves in the Hermite case and the three distinct eigenvalues are $-a,0,a$. For the case $a^2>3$, we…

We describe a way of detecting the location of localized eigenvectors of a linear system $Ax = \lambda x$ for eigenvalues $\lambda$ with $|\lambda|$ comparatively large. We define the family of functions $f_{\alpha}: \left\{1.2. \dots,…

``Localization'' has proven to be a valuable tool in the Statistical Learning literature as it allows sharp risk bounds in terms of the problem geometry. Localized bounds seem to be much less exploited in the Stochastic Optimization…

Random matrix theory has played an important role in various areas of pure mathematics, mathematical physics, and machine learning. From a practical perspective of data science, input data are usually normalized prior to processing. Thus,…

For a large class of symmetric random matrices with correlated entries, selected from stationary random fields of centered and square integrable variables, we show that the limiting distribution of eigenvalue counting measure always exists…

We consider an $N$ by $N$ real symmetric random matrix $X=(x_{ij})$ where $\mathbb{E}x_{ij}x_{kl}=\xi_{ijkl}$. Under the assumption that $(\xi_{ijkl})$ is the discretization of a piecewise Lipschitz function and that the correlation is…