November 2021 Universality and least singular values of random matrix products: A simplified approach
Rohit Chaudhuri, Vishesh Jain, Natesh S. Pillai
Author Affiliations +
Bernoulli 27(4): 2519-2531 (November 2021). DOI: 10.3150/20-BEJ1320

Abstract

In this note, we show how to provide sharp control on the least singular value of a certain translated linearization matrix arising in the study of the local universality of products of independent random matrices. This problem was first considered in a recent work of Kopel, O’Rourke, and Vu, and compared to their work, our proof is substantially simpler and established in much greater generality. In particular, we only assume that the entries of the ensemble are centered, and have second and fourth moments uniformly bounded away from 0 and infinity, whereas previous work assumed a uniform subgaussian decay condition and that the entries within each factor of the product are identically distributed.

A consequence of our least singular value bound is that the four moment matching universality results for the products of independent random matrices, recently obtained by Kopel, O’Rourke, and Vu, hold under much weaker hypotheses. Our proof technique is also of independent interest in the study of structured sparse matrices.

Citation

Download Citation

Rohit Chaudhuri. Vishesh Jain. Natesh S. Pillai. "Universality and least singular values of random matrix products: A simplified approach." Bernoulli 27 (4) 2519 - 2531, November 2021. https://doi.org/10.3150/20-BEJ1320

Information

Received: 1 September 2020; Revised: 1 December 2020; Published: November 2021
First available in Project Euclid: 24 August 2021

MathSciNet: MR4303893
zbMATH: 1473.15014
Digital Object Identifier: 10.3150/20-BEJ1320

Keywords: least singular value , Product random matrices , Universality

Rights: Copyright © 2021 ISI/BS

JOURNAL ARTICLE
13 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.27 • No. 4 • November 2021
Back to Top