Circular law for random discrete matrices of given row sum
From MaRDI portal
Publication:2443433
DOI10.4310/JOC.2013.V4.N1.A1zbMATH Open1327.60025arXiv1203.5941OpenAlexW2963576470MaRDI QIDQ2443433FDOQ2443433
Authors: Hoi Nguyen, Van Vu
Publication date: 7 April 2014
Published in: Journal of Combinatorics (Search for Journal in Brave)
Abstract: Let be a random matrix of size and let be the eigenvalues of . The empirical spectral distribution of is defined as mu_{M_n}(s,t)=frac{1}{n}# {kle n, Re(lambda_k)le s; Im(lambda_k)le t}. The circular law theorem in random matrix theory asserts that if the entries of are i.i.d. copies of a random variable with mean zero and variance , then the empirical spectral distribution of the normalized matrix of converges almost surely to the uniform distribution over the unit disk as tends to infinity. In this paper we show that the empirical spectral distribution of the normalized matrix of , a random matrix whose rows are independent random vectors of given row-sum with some fixed integer satisfying , also obeys the circular law. The key ingredient is a new polynomial estimate on the least singular value of .
Full work available at URL: https://arxiv.org/abs/1203.5941
Recommendations
Cited In (9)
- The circular law for sparse non-Hermitian matrices
- Low-degree factors of random polynomials
- Circular law for the sum of random permutation matrices
- Random doubly stochastic matrices: the circular law
- The circular law for random regular digraphs
- Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
- Spectrum of large random Markov chains: Heavy-tailed weights on the oriented complete graph
- Circular law for random matrices with unconditional log-concave distribution
- On the singularity of adjacency matrices for random regular digraphs
This page was built for publication: Circular law for random discrete matrices of given row sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443433)