Equivalence of replica and cavity methods for computing spectra of sparse random matrices

被引:13
|
作者
Slanina, Frantisek [1 ]
机构
[1] Acad Sci Czech Republ, Inst Phys, CZ-18221 Prague, Czech Republic
来源
PHYSICAL REVIEW E | 2011年 / 83卷 / 01期
关键词
DENSITY-OF-STATES; CHARACTERISTIC VECTORS; ANALYTIC COMPUTATION; EIGENVALUE SPECTRUM; BORDERED MATRICES; APPROXIMATION; LOCALIZATION; STATISTICS; DIFFUSION; PHYSICS;
D O I
10.1103/PhysRevE.83.011118
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
We show by direct calculation that the replica and cavity methods are exactly equivalent for the spectrum of an Erdos-Renyi random graph. We introduce a variational formulation based on the cavity method and use it to find approximate solutions for the density of eigenvalues. We also use this variational method for calculating spectra of sparse covariance matrices.
引用
收藏
页数:8
相关论文
共 50 条
  • [31] Bulk universality of sparse random matrices
    Huang, Jiaoyang
    Landon, Benjamin
    Yau, Horng-Tzer
    JOURNAL OF MATHEMATICAL PHYSICS, 2015, 56 (12)
  • [32] SPECTRAL METHODS WITH SPARSE MATRICES
    HEINRICHS, W
    NUMERISCHE MATHEMATIK, 1989, 56 (01) : 25 - 41
  • [33] DIRECT METHODS FOR SPARSE MATRICES
    OSTERBY, O
    ZLATEV, Z
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 157 : 1 - 127
  • [34] COMPUTATIONAL METHODS FOR SPARSE MATRICES
    NEX, CMM
    COMPUTER PHYSICS COMMUNICATIONS, 1980, 20 (01) : 7 - 10
  • [35] Spectra of euclidean random matrices
    Mézard, M
    Parisi, G
    Zee, A
    NUCLEAR PHYSICS B, 1999, 559 (03) : 689 - 701
  • [36] Singularities in the spectra of random matrices
    Walker, PN
    Sanchez, MJ
    Wilkinson, M
    JOURNAL OF MATHEMATICAL PHYSICS, 1996, 37 (10) : 5019 - 5032
  • [37] A hybrid algorithm for computing permanents of sparse matrices
    Liang, H
    Huang, SQ
    Bai, FS
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 172 (02) : 708 - 716
  • [38] On the hardness of computing the permanent of random matrices
    Feige, U
    Lund, C
    COMPUTATIONAL COMPLEXITY, 1997, 6 (02) : 101 - 132
  • [39] Sparse recovery properties of discrete random matrices
    Ferber, Asaf
    Sah, Ashwin
    Sawhney, Mehtaab
    Zhu, Yizhe
    COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (02) : 316 - 325
  • [40] The full rank condition for sparse random matrices
    Coja-Oghlan, Amin
    Gao, Pu
    Hahn-Klimroth, Max
    Lee, Joon
    Muller, Noela
    Rolvien, Maurice
    COMBINATORICS PROBABILITY AND COMPUTING, 2024,