Related papers: Edge Universality for Inhomogeneous Random Matrice…

We consider the single eigenvalue fluctuations of random matrices of general Wigner-type, under a one-cut assumption on the density of states. For eigenvalues in the bulk, we prove that the asymptotic fluctuations of a single eigenvalue…

We introduce a new technique to prove bounds for the spectral radius of a random matrix, based on using Jensen's formula to establish the zerofreeness of the associated characteristic polynomial in a region of the complex plane. Our…

We analyze the spectral properties of the high-dimensional random geometric graph $G(n, d, p)$, formed by sampling $n$ i.i.d vectors $\{v_i\}_{i=1}^{n}$ uniformly on a $d$-dimensional unit sphere and connecting each pair $\{i,j\}$ whenever…

We consider a versatile matrix model of the form ${\bf A}+i {\bf B}$, where ${\bf A}$ and ${\bf B}$ are real random circulant matrices with independent but, in general, nonidentically distributed Gaussian entries. For this model, we derive…

In this paper, we analyse a sub-class of two-dimensional homogeneous nearest neighbour (simple) random walk restricted on the lattice using the matrix geometric approach. In particular, we first present an alternative approach for the…

In this article the statistical properties of symmetrical random matrices whose elements are drawn from a q-parameterized non-extensive statistics power-law distribution are investigated. In the limit as q->1 the well known Gaussian…

We use free probability to compute the limiting spectral properties of the harmonic mean of $n$ i.i.d. Wishart random matrices $\mathbf{W}_i$ whose limiting aspect ratio is $\gamma \in (0,1)$ when $\mathbb{E}[\mathbf{W}_i] = \mathbf{I}$. We…

It is known that hermitean random matrix ensembles can be identified with symmetric coset spaces of Lie groups, or else with tangent spaces of the same. This results in a classification of random matrix ensembles as well as applications in…

In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\"os-R\'enyi random graphs in a random environment. We show that the expected number of…

The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random…

In this paper we introduce a new combinatorial approach to analyze the trace of large powers of Wigner matrices. Our approach is motivated from the paper by \citet{sosh}. However the counting approach is different. We start with classical…

In this paper we study ensembles of random symmetric matrices $\X_n = {X_{ij}}_{i,j = 1}^n$ with dependent entries such that $\E X_{ij} = 0$, $\E X_{ij}^2 = \sigma_{ij}^2$, where $\sigma_{ij}$ may be different numbers. Assuming that the…

We study limit distributions of independent random matrices as well as limit joint distributions of their blocks under normalized partial traces composed with classical expectation. In particular, we are concerned with the ensemble of…

For general non-Hermitian random matrices $X$ and deterministic deformation matrices $A$, we prove that the local eigenvalue statistics of $A+X$ close to the typical edge points of its spectrum are universal. Furthermore, we show that under…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We consider the non-Hermitian analogue of the celebrated Wigner-Dyson-Mehta bulk universality phenomenon, i.e. that in the bulk the local eigenvalue statistics of a large random matrix with independent, identically distributed centred…

We present a simple solution to a question posed by Candes, Romberg and Tao on the uniform uncertainty principle for Bernoulli random matrices. More precisely, we show that a rectangular k*n random subgaussian matrix (with k < n) has the…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

In this work we study symmetric random matrices with variance profile satisfying certain conditions. We establish the convergence of the operator norm of these matrices to the largest element of the support of the limiting empirical…