Related papers: Local Marchenko-Pastur Law for Random Bipartite Gr…
It is known (Hofmann-Credner and Stolz (2008)) that the convergence of the mean empirical spectral distribution of a sample covariance matrix W_n = 1/n Y_n Y_n^t to the Mar\v{c}enko-Pastur law remains unaffected if the rows and columns of…
We consider real symmetric and complex Hermitian random matrices with the additional symmetry $h_{xy}=h_{N-x,N-y}$. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble…
We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…
We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem proven by Gurvits and…
We consider a complete bipartite graph of size $n$ endowed with i.i.d. uniform edge weights and run Prim's Algorithm to obtain a ranking of its vertices. Let $\rho^{(n)}_k$ be the proportion of black vertices among the first $k$ vertices in…
This work is concerned with finite range bounds on the variance of individual eigenvalues of Wigner random matrices, in the bulk and at the edge of the spectrum, as well as for some intermediate eigenvalues. Relying on the GUE example,…
The purpose of this article is to introduce a new iterative algorithm with properties resembling real life bipartite graphs. The algorithm enables us to generate wide range of random bigraphs, which features are determined by a set of…
Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral…
We consider a general class of $N\times N$ random matrices whose entries $h_{ij}$ are independent up to a symmetry constraint, but not necessarily identically distributed. Our main result is a local semicircle law which improves previous…
Let $\mathbf X=(X_{jk})$ denote a $n\times p$ random matrix with entries $X_{jk}$, which are independent for $1\le j\le n, 1\le k\le p$. Let $n,p$ tend to infinity such that $\frac np=y+O(n^{-1})\in(0,1]$. For those values of $n,p$ we…
In this work we consider the {\em analog bipartite spin-glass} (or {\em real-valued restricted Boltzmann machine} in a neural network jargon), whose variables (those quenched as well as those dynamical) share standard Gaussian…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
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…
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…
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…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
We show that a weak concentration property for quadratic forms of isotropic random vectors ${\bf x}$ is necessary and sufficient for the validity of the Marchenko-Pastur theorem for sample covariance matrices of random vectors having the…
We study the eigenvalue distributions for sums of independent rank-one $k$-fold tensor products of large $n$-dimensional vectors. Previous results in the literature assume that $k=o(n)$ and show that the eigenvalue distributions converge to…
We consider the fluctuations of the largest eigenvalue of sparse random matrices, the class of random matrices that includes the normalized adjacency matrices of the Erd\H{o}s-R\'enyi graph $G(N, p)$. We show that the fluctuations of the…