Related papers: Spiking the random matrix hard edge

In a paper that appeared in 2010, C. Tone proved a multivariate central limit theorem for some strictly stationary random fields of random vectors satisfying certain mixing conditions. The "normalization" of a given "partial sum" (or "block…

We consider matrices formed by a random $N\times N$ matrix drawn from the Gaussian Orthogonal Ensemble (or Gaussian Unitary Ensemble) plus a rank-one perturbation of strength $\theta$, and focus on the largest eigenvalue, $x$, and the…

We analyze the asymptotic fluctuations of linear eigenvalue statistics of random centrosymmetric matrices with i.i.d. entries. We prove that for a complex analytic test function, the centered and normalized linear eigenvalue statistics of…

We study the statistics of the largest eigenvalue lambda_max of N x N random matrices with unit variance, but power-law distributed entries, P(M_{ij})~ |M_{ij}|^{-1-mu}. When mu > 4, lambda_max converges to 2 with Tracy-Widom fluctuations…

Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…

In this paper, we study the asymptotic behavior of the extreme eigenvalues and eigenvectors of the spiked covariance matrices, in the supercritical regime. Specifically, we derive the joint distribution of the extreme eigenvalues and the…

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

The hard edge and bulk scaling limits of $\beta$-ensembles are described by the stochastic Bessel and sine operators, which are respectively a random Sturm-Liouville operator and a random Dirac operator. By representing both operators as…

Recently we considered a class of random matrices obtained by choosing distinct codewords at random from linear codes over finite fields and proved that under some natural algebraic conditions their empirical spectral distribution converges…

We define a class of random matrix ensembles that pertain to random looped polymers. Such random looped polymers are a possible model for bio-polymers such as chromatin in the cell nucleus. It is shown that the distribution of the largest…

Block Toeplitz and Hankel matrices arise in many aspects of applications. In this paper, we will research the distributions of eigenvalues for some models and get the semicircle law. Firstly we will give trace formulae of block Toeplitz and…

Considered are the large $N$, or large intensity, forms of the distribution of the length of the longest increasing subsequences for various models. Earlier work has established that after centring and scaling, the limit laws for these…

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…

We develop a new method for deriving local laws for a large class of random matrices. It is applicable to many matrix models built from sums and products of deterministic or independent random matrices. In particular, it may be used to…

We consider extremal eigenvalues of sparse random matrices, a class of random matrices including the adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs $\mathcal{G}(N,p)$. Recently, it was shown that the leading order fluctuations of extremal…

The $\beta$ ensembles are a class of eigenvalue probability densities which generalise the invariant ensembles of classical random matrix theory. In the case of the Gaussian and Laguerre weights, the corresponding eigenvalue densities are…

We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low…

We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…

We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…

We address light propagation properties in complex media consisting of random distributions of lenses that have specific focusing properties. We present both analytical and numerical techniques that can be used to study emergent properties…