On $r$-to-$p$ norms of random matrices with nonnegative entries: Asymptotic normality and $\ell_\infty$-bounds for the maximizer
Souvik Dhara, Debankur Mukherjee, Kavita Ramanan

TL;DR
This paper establishes the asymptotic normality of $r$-to-$p$ norms of symmetric nonnegative random matrices and provides $ ext{ell}_ ext{infinity}$ bounds for their maximizers, extending classical results to broader matrix classes.
Contribution
It introduces new techniques for analyzing the $r$-to-$p$ norms of random matrices, including a nonlinear power method and stability bounds, generalizing prior work on spectral norms.
Findings
Asymptotic normality of $ ext{ell}_p$ maximization solutions for large $n$
Sharp $ ext{ell}_ ext{infinity}$ bounds for the maximizers
Extension of classical results to broader matrix classes
Abstract
For an matrix , the operator norm is defined as For different choices of and , this norm corresponds to key quantities that arise in diverse applications including matrix condition number estimation, clustering of data, and construction of oblivious routing schemes in transportation networks. This article considers norms of symmetric random matrices with nonnegative entries, including adjacency matrices of Erd\H{o}s-R\'enyi random graphs, matrices with positive sub-Gaussian entries, and certain sparse matrices. For , the asymptotic normality, as , of the appropriately centered and scaled norm is established. When , this is shown to imply asymptotic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Point processes and geometric inequalities · Topological and Geometric Data Analysis
