Related papers: Local laws for multiplication of random matrices

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.…

We use the linear programming algorithm introduced by Akulin et al. [V. M. Akulin, G. A. Kabatiansky, and A. Mandilara, Phys. Rev. A 92, 042322 (2015)] to perform best separable approximation on two-qutrit random density matrices. We…

We consider large random matrices $X$ with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical…

We define the empirical spectral distribution (ESD) of a random matrix polynomial with invertible leading coefficient, and we study it for complex $n \times n$ Gaussian monic matrix polynomials of degree $k$. We obtain exact formulae for…

We discuss the limiting spectral density of real symmetric random matrices. Other than in standard random matrix theory the upper diagonal entries are not assumed to be independent, but we will fill them with the entries of a stochastic…

We consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $\alpha$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by…

Modularity is a popular metric for quantifying the degree of community structure within a network. The distribution of the largest eigenvalue of a network's edge weight or adjacency matrix is well studied and is frequently used as a…

We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…

Using exact numerical diagonalization, we investigate localization in two classes of random matrices corresponding to random graphs. The first class comprises the adjacency matrices of Erdos-Renyi (ER) random graphs. The second one…

The empirical eigenvalue distribution of the elliptic random matrix ensemble tends to the uniform measure on an ellipse in the complex plane as its dimension tends to infinity. We show this convergence on all mesoscopic scales slightly…

Consider a random block matrix model consisting of $D$ random systems arranged along a circle, where each system is modeled by an independent $N\times N$ complex Hermitian Wigner matrix. Neighboring systems interact via an arbitrary…

Let $\mathcal A$ be the adjacency matrix of the Erd\H{o}s-R\'{e}nyi directed graph $\mathscr G(N,p)$. We denote the eigenvalues of $\mathcal A$ by $\lambda_1^{\cal A},...,\lambda^{\cal A}_N$, and $|\lambda_1^{\cal A}|=\max_i|\lambda_i^{\cal…

We investigate distributional properties of a class of spectral spatial statistics under irregular sampling of a random field that is defined on $\mathbb{R}^d$, and use this to obtain a test for isotropy. Within this context, edge effects…

We consider $N\times N$ Hermitian random matrices with independent identical distributed entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order 1/N. Under suitable assumptions on the…

Let $U$ and $V$ be two independent $N$ by $N$ random matrices that are distributed according to Haar measure on $U(N)$. Let $\Sigma$ be a non-negative deterministic $N$ by $N$ matrix. The single ring theorem [26] asserts that the empirical…

Consider an exponential dispersion model (EDM) generated by a probability $ \mu $ on $[0,\infty )$ which is infinitely divisible with an unbounded L\'{e}vy measure $\nu $. The Jorgensen set (i.e., the dispersion parameter space) is then…

For correlated real symmetric or complex Hermitian random matrices, we prove that the local eigenvalue statistics at any cusp singularity are universal. Since the density of states typically exhibits only square root edge or cubic root cusp…

Estimation of Distribution Algorithms (EDAs) are stochastic heuristics that search for optimal solutions by learning and sampling from probabilistic models. Despite their popularity in real-world applications, there is little rigorous…

We consider Hermite and Laguerre $\beta$-ensembles of large $N\times N$ random matrices. For all $\beta$ even, corrections to the limiting global density are obtained, and the limiting density at the soft edge is evaluated. We use the…

Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…