Replica methods for loopy sparse random graphs

被引：0
|
作者：
机构：
[1] Coolen, A.C.C.
来源：
Coolen, A.C.C. (ton.coolen@kcl.ac.uk) | 2016年 / IOP Publishing Ltd卷 / 699期
关键词：
723.1 Computer Programming - 723.2 Data Processing and Image Processing - 921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory - 922.2 Mathematical Statistics - 961 Systems Science;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
47
引用
收藏
相关论文
共 50 条
  • [1] Replica methods for loopy sparse random graphs
    Coolen, A. C. C.
    INTERNATIONAL MEETING ON HIGH-DIMENSIONAL DATA-DRIVEN SCIENCE (HD3-2015), 2016, 699
  • [2] Imaginary replica analysis of loopy regular random graphs
    Lopez, Fabian Aguirre
    Coolen, Anthony C. C.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2020, 53 (06)
  • [3] Equivalence of replica and cavity methods for computing spectra of sparse random matrices
    Slanina, Frantisek
    PHYSICAL REVIEW E, 2011, 83 (01):
  • [4] The random field XY model on sparse random graphs shows replica symmetry breaking and marginally stable ferromagnetism
    Lupo, Cosimo
    Parisi, Giorgio
    Ricci-Tersenghi, Federico
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2019, 52 (28)
  • [5] On replica symmetry of large deviations in random graphs
    Lubetzky, Eyal
    Zhao, Yufei
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 109 - 146
  • [6] The diameter of sparse random graphs
    Chung, F
    Lu, LY
    ADVANCES IN APPLIED MATHEMATICS, 2001, 26 (04) : 257 - 279
  • [7] Bisecting sparse random graphs
    Luczak, MJ
    McDiarmid, C
    RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (01) : 31 - 38
  • [8] Sparse Random Graphs with Clustering
    Bollobas, Bela
    Janson, Svante
    Riordan, Oliver
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (03) : 269 - 323
  • [9] Dismantling sparse random graphs
    Department of Mathematics, Uppsala University, PO Box 480, SE-75.1 06 Uppsala, Sweden
    不详
    Comb. Probab. Comput., 2008, 2 (259-264):
  • [10] The diameter of sparse random graphs
    Fernholz, Daniel
    Ramachandran, Vijaya
    RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (04) : 482 - 516
12345