Related papers: Local semicircle law for random regular graphs

Let $G$ be a random $d$-regular graph. We prove that for every constant $\alpha > 0$, with high probability every eigenvector of the adjacency matrix of $G$ with eigenvalue less than $-2\sqrt{d-2}-\alpha$ has $\Omega(n/$polylog$(n))$ nodal…

Let $\mathbf X=(X_{jk})$ denote a Hermitian random matrix with entries $X_{jk}$, which are independent for $1\le j\le k$. We consider the rate of convergence of the empirical spectral distribution function of the matrix $\mathbf X$ to the…

A large i.i.d. random matrix with deterministic low-rank perturbation has been extensively studied, particularly in the aspects of the ESD (Empirical Spectral Distribution) and the outliers of eigenvalues. In this work, we investigate the…

It is well known that the spectral measure of eigenvalues of a rescaled square non-Hermitian random matrix with independent entries satisfies the circular law. We consider the product $TX$, where $T$ is a deterministic $N\times M$ matrix…

This work addresses the Galerkin isogeometric discretization of the one-dimensional Laplace eigenvalue problem subject to homogeneous Dirichlet boundary conditions on a bounded interval. We employ GLT theory to analyze the behavior of the…

We prove that arithmetic quantum unique ergodicity holds on compact arithmetic quotients of $GL(2,\mathbb{Q}_p)$ for automorphic forms belonging to the principal series. We interpret this conclusion in terms of the equidistribution of…

We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…

We consider the uniform random $d$-regular graph on $N$ vertices, with $d \in [N^\alpha, N^{2/3-\alpha}]$ for arbitrary $\alpha > 0$. We prove that in the bulk of the spectrum the local eigenvalue correlation functions and the distribution…

In this article we present a statistical version of the Candes-Tao restricted isometry property (SRIP for short) which holds in general for any incoherent dictionary which is a disjoint union of orthonormal bases. In addition, we show that,…

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…

For many wave propagation problems with random sources it has been demonstrated that cross correlations of wave fields are proportional to the imaginary part of the Green function of the underlying wave equation. This leads to the inverse…

We study random normal matrix models whose eigenvalues tend to be distributed within a narrow "band" around the unit circle of width proportional to $\frac1n$, where $n$ is the size of matrices. For general radially symmetric potentials…

In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…

We study the spectral properties of the adjacency matrix in the giant connected component of Erd\"os-R\'enyi random graphs, with average connectivity $p$ and randomly distributed hopping amplitudes. By solving the self-consistent cavity…

Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…

This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…

We show that the distribution of self-normalized sums of free self-adjoint random variables converges weakly to Wigner's semicircle law under appropriate conditions and estimate the rate of convergence in terms of the Kolmogorov distance.…

In this article, we analyze the limiting eigenvalue distribution (LED) of random geometric graphs (RGGs). The RGG is constructed by uniformly distributing $n$ nodes on the $d$-dimensional torus $\mathbb{T}^d \equiv [0, 1]^d$ and connecting…

We propose a novel method to test the existence of community structure of undirected real-valued edge-weighted graph. The method is based on Wigner semicircular law on the asymptotic behavior of the random distribution for eigenvalues of a…