相关论文: Proof of a conjecture on the infinite dimension li…

Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices. We show that, as long as $d\to\infty$ with…

In this paper, we study the convergence rates of empirical spectral distribution of large dimensional quaternion sample covariance matrix. Assume that the entries of $\mathbf X_n$ ($p\times n$) are independent quaternion random variables…

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 study matricial approximations of master fields we constructed in a previous work. These approximations (in non-commutative distribution) are obtained by extracting blocks of a Brownian unitary diffusion (with entries in $\mathbb{R},…

We establish the limiting spectral distribution of Kendall's correlation matrices in the moderate high-dimensional regime where the dimension grows slower than the sample size. Our framework allows observations to be independent but not…

In this article we investigate high-dimensional banded sample covariance matrices under the regime that the sample size $n$, the dimension $p$ and the bandwidth $d$ tend simultaneously to infinity such that $$n/p\to 0 \ \ \text{and} \ \…

In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in the $1$-cut metric. On the other hand, we give examples of…

We consider randomized dynamics over the $n$-simplex, where at each step a random set, or block, of coordinates is evenly averaged. When all blocks have size 2, this reduces to the repeated averages studied in [CDSZ22], a version of the…

We consider the random matrix obtained by picking vectors randomly from a large collection of mutually unbiased bases of $\mathbb{C}^n$, and prove that the spectral distribution converges to the Marchenko-Pastur law. This shows that vectors…

We study the problem of coupling a stochastic block model with a planted bisection to a uniform random graph having the same average degree. Focusing on the regime where the average degree is a constant relative to the number of vertices…

We consider 1d random Hermitian $N\times N$ block band matrices consisting of $W\times W$ random Gaussian blocks (parametrized by $j,k \in\Lambda=[1,n]\cap \mathbb{Z}$, $N=nW$) with a fixed entry's variance…

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in J Stat Phys 164:1233 -- 1260, 2016; Commun Math Phys 351:1009 -- 1044, 2017. We consider random Hermitian…

We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…

Dynamical systems of N particles in \R^{D} interacting by a singular pair potential of mean field type are considered. The systems are assumed to be of gradient type and the existence of a macroscopic limit in the many particle limit is…

Given an ensemble of NxN random matrices, a natural question to ask is whether or not the empirical spectral measures of typical matrices converge to a limiting spectral measure as N --> oo. While this has been proved for many thin…

Consider a square random matrix with independent and identically distributed entries of mean zero and unit variance. We show that as the dimension tends to infinity, the spectral radius is equivalent to the square root of the dimension in…

Patterned random matrices such as the reverse circulant, the symmetric circulant, the Toeplitz and the Hankel matrices and their almost sure limiting spectral distribution (LSD), have attracted much attention. Under the assumption that the…

We study random graphs with possibly different edge probabilities in the challenging sparse regime of bounded expected degrees. Unlike in the dense case, neither the graph adjacency matrix nor its Laplacian concentrate around their…

We exhibit an explicit formula for the spectral density of a (large) random matrix which is a diagonal matrix whose spectral density converges, perturbated by the addition of a symmetric matrix with Gaussian entries and a given (small)…

We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of $N\times N$ matrices whose entries are chosen independently from a Bernoulli distribution…