Related papers: The Mar\v{c}enko-Pastur law for sparse random bipa…

We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive…

It is shown that the Kolmogorov distance between the spectral distribution function of a random covariance matrix $\frac1p XX^T$, where $X$ is a $n\times p$ matrix with independent entries and the distribution function of the…

In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…

We proved that for any finite collection of sparse subgraphs $(D_m)_{m=1}^\ell$ of the complete graph $K_{2n}$, and a uniformly chosen perfect matching $R$ in $K_{2n}$, the random vector $(|E(R \cap D_m)|)_{m=1}^\ell$ jointly converges to a…

We consider Erd\H{o}s-R\'enyi-type random hypergraphs that are non-uniform, in the sense that hyperedges of different sizes may coexist, and inhomogeneous, in that connection probabilities may depend on the hyperedge size. All parameters…

We construct a random matrix model for the bijection \Psi between clas- sical and free infinitely divisible distributions: for every d\geq1, we associate in a quite natural way to each *-infinitely divisible distribution \mu a distribution…

Let $X_N$ be a $N\times N$ matrix whose entries are i.i.d. complex random variables with mean zero and variance $\frac{1}{N}$. We study the asymptotic spectral distribution of the eigenvalues of the covariance matrix $X_N^*X_N$ for…

This paper introduces a new method to estimate the spectral distribution of a population covariance matrix from high-dimensional data. The method is founded on a meaningful generalization of the seminal Marcenko-Pastur equation, originally…

A bipartite graph $H$ is said to have Sidorenko's property if the probability that the uniform random mapping from $V(H)$ to the vertex set of any graph $G$ is a homomorphism is at least the product over all edges in $H$ of the probability…

Suppose $X_p$ is a real $p \times n$ matrix with independent entries and consider the (unscaled) sample covariance matrix $S_p=X_pX_p^T$. The Marchenko-Pastur law was discovered as the limit of the bulk distribution of the sample covariance…

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

Two landmark results in combinatorial random matrix theory, due to Koml\'os and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph…

We study the asymptotic of the spectral distribution for large empirical covariance matrices composed of independent Multifractal Random Walk processes. The asymptotic is taken as the observation lag shrinks to 0. In this setting, we show…

This paper studies the asymptotic spectral properties of the sample covariance matrix for high dimensional compositional data, including the limiting spectral distribution, the limit of extreme eigenvalues, and the central limit theorem for…

We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let $H$ be a bipartite graph with $v$ vertices and $e$ edges, where $v\le e$, and write $M(G)=2e(G)$. We…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

This paper investigates the spectral properties of spatial-sign covariance matrices, a self-normalized version of sample covariance matrices, for data from $\alpha$-regularly varying populations with general covariance structures. By…

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…

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…

This paper studies the limiting behavior of Tyler's M-estimator for the scatter matrix, in the regime that the number of samples $n$ and their dimension $p$ both go to infinity, and $p/n$ converges to a constant $y$ with $0<y<1$. We prove…