Circular law for random matrices with exchangeable entries1. Issue 3 (8th September 2015)

• Record Type: Journal Article
• Authors: Adamczak, Radosław; Chafaï, Djalil; Wolff, Paweł
• Is Part Of: Random structures & algorithms. Volume 48:Issue 3(2016)
• Page Start: 454
• Page End: 479
• Publication Date: 2015-09-08
• Subjects: random permutations -- random matrices -- combinatorial central Limit theorem -- exchangeable distributions -- concentration of measure -- smallest singular value -- spectral analysis; Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20599
• Languages: English
• ISSNs: 1042-9832

Abstract

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. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 454–479, 2016