SearcharxivSearch

arXiv · 2005.14056

On $r$-to-$p$ norms of random matrices with nonnegative entries: Asymptotic normality and $\ell_\infty$-bounds for the maximizer

Abstract

For an $n\times n$ matrix $A_n$, the $r\to p$ operator norm is defined as $$\|A_n\|_{r\to p}:= \sup_{\mathbf{x}\in\mathbb{R}^n:\|\mathbf{x} \|_r\leq 1 } \|A_n\mathbf{x} \|_p\quad\text{for}\quad r,p\geq 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\to p$ 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 $1<p\leq r<\infty$, the asymptotic normality, as $n\to\infty$, of the appropriately centered and scaled norm $\|A_n\|_{r\to p}$ is established. When $p \geq 2$, this is shown to imply asymptotic normality of the solution to the $\ell_p$ quadratic maximization problem, also known as the $\ell_p$ Grothendieck problem. Furthermore, a sharp $\ell_\infty$-approximation bound for the unique maximizing vector in the definition of $\|A_n\|_{r\to p}$ is obtained, and may be viewed as an $\ell_\infty$-stability result of the maximizer under random perturbations of the matrix with mean entries. This result 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\"{u}redi and Koml\'{o}s (1981) on asymptotic normality of the largest singular value of a class of symmetric random matrices. In the general case with $1<p\leq r< \infty$, 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Souvik Dhara, Debankur Mukherjee, Kavita Ramanan. 2020-05-28. On $r$-to-$p$ norms of random matrices with nonnegative entries: Asymptotic normality and $\ell_\infty$-bounds for the maximizer. https://arxiv.org/abs/2005.14056

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR