Guilhem Semerjian and Leticia F Cugliandolo 2002 J. Phys. A: Math. Gen. 35 4837 doi:10.1088/0305-4470/35/23/303
Guilhem Semerjian1 and Leticia F Cugliandolo1,2
Show affiliationsWe 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 (1999 J. Phys. A: Math. Gen. 32 L255) 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 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.
Issue 23 (14 June 2002)
Received 27 February 2002, in final form 19 April 2002
Published 31 May 2002
Guilhem Semerjian and Leticia F Cugliandolo 2002 J. Phys. A: Math. Gen. 35 4837
Andrea Montanari et al J. Stat. Mech. (2008) P04004
Federico Ricci-Tersenghi and Guilhem Semerjian J. Stat. Mech. (2009) P09001
Enzo Marinari and Guilhem Semerjian J. Stat. Mech. (2006) P06019
Shang-Peng Gao et al 2009 J. Phys.: Condens. Matter 21 104203
Brian L Tierney et al 2007 J. Phys.: Conf. Ser. 78 012075
A. Glatz et al 2008 EPL 82 47002
A. Glatz and I. S. Beloborodov 2009 EPL 87 57009
Dan Milisavljevic et al. 2008 ApJ 684 1170
Guilhem Semerjian and Martin Weigt 2004 J. Phys. A: Math. Gen. 37 5525