Related papers: Local law for eigenvalues of random regular bipart…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
The spectral and localization properties of heterogeneous random graphs are determined by the resolvent distributional equations, which have so far resisted an analytic treatment. We solve analytically the resolvent equations of random…
We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides…
This paper is the second chapter of three of the author's undergraduate thesis. In this paper, we consider the random matrix ensemble given by $(d_b, d_w)$-regular graphs on $M$ black vertices and $N$ white vertices, where $d_b \in…
These notes provide an introduction to the local semicircle law from random matrix theory, as well as some of its applications. We focus on Wigner matrices, Hermitian random matrices with independent upper-triangular entries with zero…
In this paper we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions of the codes their empirical spectral…
Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…
We study the limiting spectral distribution of large-dimensional sample covariance matrices associated with symmetric random tensors formed by $\binom{n}{d}$ different products of $d$ variables chosen from $n$ independent standardized…
We introduce the $N\times N$ random matrices $$ X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables}, $$ and $d$ a…
The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander…
Consider the random matrix model $A^{1/2} UBU^* A^{1/2},$ where $A$ and $B$ are two $N \times N$ deterministic matrices and $U$ is either an $N \times N$ Haar unitary or orthogonal random matrix. It is well-known that on the macroscopic…
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 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$…
Random-matrix theory is applied to transition-rate matrices in the Pauli master equation. We study the distribution and correlations of eigenvalues, which govern the dynamics of complex stochastic systems. Both the cases of identical and 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 consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
Estimating the eigenvalues of a population covariance matrix from a sample covariance matrix is a problem of fundamental importance in multivariate statistics; the eigenvalues of covariance matrices play a key role in many widely…
Bandeira et al. (2017) show that the eigenvalues of the Kendall correlation matrix of $n$ i.i.d. random vectors in $\mathbb{R}^p$ are asymptotically distributed like $1/3 + (2/3)Y_q$, where $Y_q$ has a Mar\v{c}enko-Pastur law with parameter…
One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random…