Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T20:07:40.419Z Has data issue: false hasContentIssue false

Sparse random matrices: spectral edge and statistics of rooted trees

Published online by Cambridge University Press:  01 July 2016

A. Khorunzhy*
Affiliation:
Institute for Low Temperature Physics, Ukraine
*
∗ Current address: Faculté de Mathematiques, Université Paris 7–Denis Diderot, 2 Place Jussieu, Paris 75251 Cedex 05, France. Email address: khorunjy@ilt.kharkov.ua

Abstract

Following Füredi and Komlós, we develop a graph theory method to study the high moments of large random matrices with independent entries. We apply this method to sparse N × N random matrices A N,p that have, on average, p non-zero elements per row. One of our results is related to the asymptotic behaviour of the spectral norm ∥A N,p ∥ in the limit 1 ≪ p ≪ N. We show that the value pc = log N is the critical one for lim ∥A N,p /√p∥ to be bounded or not. We discuss relations of this result with the Erdős–Rényi limit theorem and properties of large random graphs. In the proof, the principal issue is that the averaged vertex degree of plane rooted trees of k edges remains bounded even when k → ∞. This observation implies fairly precise estimates for the moments of A N,p . They lead to certain generalizations of the results by Sinai and Soshnikov on the universality of local spectral statistics at the border of the limiting spectra of large random matrices.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2001 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable