相关论文: Eigenvalues of Euclidean Random Matrices

Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix…

This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between…

We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…

We study the eigenvector mass distribution of an $N\times N$ Wigner matrix on a set of coordinates $I$ satisfying $| I | \ge c N$ for some constant $c >0$. For eigenvectors corresponding to eigenvalues at the spectral edge, we show that the…

The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…

We consider the convergence of the empirical spectral measures of random $N \times N$ unitary matrices. We give upper and lower bounds showing that the Kolmogorov distance between the spectral measure and the uniform measure on the unit…

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…

Consider the random matrix $\Sigma = D^{1/2} X \widetilde D^{1/2}$ where $D$ and $\widetilde D$ are deterministic Hermitian nonnegative matrices with respective dimensions $N \times N$ and $n \times n$, and where $X$ is a random matrix with…

We derive the mean eigenvalue density for symmetric Gaussian random N x N matrices in the limit of large N, with a constraint implying that the row sum of matrix elements should vanish. The result is shown to be equivalent to a result found…

We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…

We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo…

We study ensembles of sparse random block matrices generated from the adjacency matrix of a Erd\"os-Renyi random graph with $N$ vertices of average degree $Z$, inserting a real symmetric $d \times d$ random block at each non-vanishing…

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…

In this paper we calculate, in the large N limit, the eigenvalue density of an infinite product of random unitary matrices, each of them generated by a random hermitian matrix. This is equivalent to solving unitary diffusion generated by a…

In this article we investigate high-dimensional banded sample covariance matrices under the regime that the sample size $n$, the dimension $p$ and the bandwidth $d$ tend simultaneously to infinity such that $$n/p\to 0 \ \ \text{and} \ \…

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

We study the universal properties of distributions of eigenvalues of random matrices in the large $N$ limit. The distributions fall in universality classes characterized entirely by the support of the spectral density.

Given the adjacency matrix of an undirected graph, we define a coupling of the spectral measures at the vertices, whose moments count the rooted closed paths in the graph. The resulting joint spectral measure verifies numerous interesting…

We consider the empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…

Consider a random regular graph of fixed degree $d$ with $n$ vertices. We study spectral properties of the adjacency matrix and of random Schr\"odinger operators on such a graph as $n$ tends to infinity. We prove that the integrated density…