Circular law for random matrices with exchangeable entries

From MaRDI portal
Publication:2811159

DOI10.1002/RSA.20599zbMATH Open1338.60009arXiv1402.3660OpenAlexW2101062161WikidataQ115150367 ScholiaQ115150367MaRDI QIDQ2811159FDOQ2811159

Paweł Wolff, Djalil Chafaï, Radosław Adamczak

Publication date: 10 June 2016

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Abstract: An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the uniform law on the unit disc. This is an instance of the universality phenomenon known as the circular law, for a model of random matrices with dependent entries, rows, and columns. It is also a non-Hermitian counterpart of a result of Chatterjee on the semi-circular law for random Hermitian matrices with exchangeable entries. The proof relies in particular on a reduction to a simpler model given by a random shuffle of a rigid deterministic matrix, on Hermitization, and also on combinatorial concentration of measure and combinatorial Central Limit Theorem. A crucial step is a polynomial bound on the smallest singular value of exchangeable random matrices, which may be of independent interest.


Full work available at URL: https://arxiv.org/abs/1402.3660




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Circular law for random matrices with exchangeable entries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811159)