Tree walks and the spectrum of random graphs

DOI10.4230/LIPICS.AOFA.2024.11MaRDI QIDQ6865688zbMATH OpenFDO

Authors Eva-Maria Hainzl, Elie de Panafieu

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.AOFA.2024.11

zbMATH Keywords

generating functionsspectrum of random matrices

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites work

• A generalization of Wigner's law
• Analytic combinatorics
• Characteristic vectors of bordered matrices with infinite dimensions
• Emergence of extended states at zero in the spectrum of sparse random graphs
• Every totally real algebraic integer is a tree eigenvalue
• scientific article; zbMATH DE number 994432 (Why is no real title available?)
• Lagrange inversion
• Mean quantum percolation
• On the distribution of the roots of certain symmetric matrices
• Random incidence matrices: moments of the spectral density
• Random Matrices in Physics
• Random matrix theory
• Random Matrix Theory and Wireless Communications
• Sparse random graphs: eigenvalues and eigenvectors
• Spectra of large diluted but bushy random graphs
• Spectral atoms of unimodular random trees
• The eigenvalues of random symmetric matrices
• The expected eigenvalue distribution of a large regular graph
• The number of connected sparsely edged graphs
• The rank of diluted random graphs

This page was built for publication: Tree walks and the spectrum of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865688)