On r-to-p norms of random matrices with nonnegative entries: Asymptotic normality and ℓ∞-bounds for the maximizer

For an n×n matrix An, the r→p operator norm is defined as ‖A n‖r→p:=supx∈Rn:‖x‖r≤1‖Anx‖pforr,p≥1. For different choices of r and p, 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 r→p norms of symmetric random matrices with nonnegative entries, including adjacency matrices of Erdős–Rényi random graphs, matrices with positive sub-Gaussian entries, and certain sparse matrices. For 1<p≤r<∞, the asymptotic normality, as n→∞, of the appropriately centered and scaled norm ‖An‖r→p is established. When p≥2, this is shown to imply, as a corollary, asymptotic normality of the solution to the ℓp quadratic maximization problem, also known as the ℓp Grothendieck problem. Furthermore, a sharp ℓ∞-approximation bound for the unique maximizing vector in the definition of ‖An‖r→p is obtained, and may be viewed as an ℓ∞-stability result of the maximizer under random perturbations of the matrix with mean entries. This result, which may be of independent interest, is in fact shown to hold for a broad class of deterministic sequences of matrices having certain asymptotic expansion properties. The results obtained can be viewed as a generalization of the seminal results of Füredi and Komlós (1981) on asymptotic normality of the largest singular value of a class of symmetric random matrices, which corresponds to the special case r=p=2 considered here. In the general case with 1<p≤r<∞, spectral methods are no longer applicable, and so a new approach is developed involving a refined convergence analysis of a nonlinear power method and a perturbation bound on the maximizing vector, which may be of independent interest.