Sparse random matrices: the eigenvalue spectrum revisited

From MaRDI portal
Publication:4465751

DOI10.1088/0305-4470/35/23/303zbMATH Open1066.82019arXivcond-mat/0202406OpenAlexW3105371085MaRDI QIDQ4465751FDOQ4465751

Leticia F. Cugliandolo, Guilhem Semerjian

Publication date: 9 June 2004

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum.


Full work available at URL: https://arxiv.org/abs/cond-mat/0202406




Recommendations




Cited In (38)





This page was built for publication: Sparse random matrices: the eigenvalue spectrum revisited

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