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 条
  • [31] Sparse Quasi-Random Graphs
    Fan Chung
    Ronald Graham
    Combinatorica, 2002, 22 : 217 - 244
  • [32] The cover time of sparse random graphs
    Cooper, Colin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (1-2) : 1 - 16
  • [33] PUSH IS FAST ON SPARSE RANDOM GRAPHS
    Meier, Florian
    Peter, Ueli
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 29 - 49
  • [34] The largest hole in sparse random graphs
    Draganic, Nemanja
    Glock, Stefan
    Krivelevich, Michael
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (04) : 666 - 677
  • [35] A note on coloring sparse random graphs
    Sommer, Christian
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3381 - 3384
  • [36] Cycle lengths in sparse random graphs
    Alon, Yahav
    Krivelevich, Michael
    Lubetzky, Eyal
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (03) : 444 - 461
  • [37] Chromatic Thresholds in Sparse Random Graphs
    Allen, Peter
    Bottcher, Julia
    Griffiths, Simon
    Kohayakawa, Yoshiharu
    Morris, Robert
    RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (02) : 215 - 236
  • [38] Majority dynamics on sparse random graphs
    Chakraborti, Debsoumya
    Kim, Jeong Han
    Lee, Joonkyung
    Tran, Tuan
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (01) : 171 - 191
  • [39] The friendship paradox for sparse random graphs
    Hazra, Rajat Subhra
    den Hollander, Frank
    Parvaneh, Azadeh
    PROBABILITY THEORY AND RELATED FIELDS, 2025,
  • [40] EXTREMAL CUTS OF SPARSE RANDOM GRAPHS
    Dembo, Amir
    Montanari, Andrea
    Sen, Subhabrata
    ANNALS OF PROBABILITY, 2017, 45 (02): : 1190 - 1217
12345