Sparse random matrices: spectral edge and statistics of rooted trees

DOI10.1239/aap/999187900zbMath0979.15023arXivmath/9905015OpenAlexW2090589820MaRDI QIDQ2726720

Alexei Khorunzhy

Publication date: 12 February 2002

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9905015

zbMATH Keywords

universality conjecturerooted treesspectral normsparse random matricesenumeration of treesspectral edgehigh momentsErdős-Renyi limit theoremErdős-Renyi partial sumlarge random graph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Random matrices (algebraic aspects) (15B52)

Related Items (11)

Local law and Tracy-Widom limit for sparse random matrices ⋮ Angular synchronization by eigenvectors and semidefinite programming ⋮ Outliers in spectrum of sparse Wigner matrices ⋮ Two-parameter non-commutative central limit theorem ⋮ Spectral radii of sparse random matrices ⋮ Sparse regular random graphs: spectral density and eigenvectors ⋮ The \((q, t)\)-Gaussian process ⋮ Lifshitz tails for spectra of Erdős-Rényi random graphs ⋮ Asymptotic properties of resolvents of large dilute Wigner random matrices ⋮ Spectral norm of products of random and deterministic matrices ⋮ On High Moments of Strongly Diluted Large Wigner Random Matrices

This page was built for publication: Sparse random matrices: spectral edge and statistics of rooted trees