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 条
  • [21] INDUCED TREES IN SPARSE RANDOM GRAPHS
    DELAVEGA, WF
    GRAPHS AND COMBINATORICS, 1986, 2 (03) : 227 - 231
  • [22] LONG PATHS IN SPARSE RANDOM GRAPHS
    BOLLOBAS, B
    COMBINATORICA, 1982, 2 (03) : 223 - 228
  • [23] The largest eigenvalue of sparse random graphs
    Krivelevich, M
    Sudakov, B
    COMBINATORICS PROBABILITY & COMPUTING, 2003, 12 (01): : 61 - 72
  • [24] Largest sparse subgraphs of random graphs
    Fountoulakis, Nikolaos
    Kang, Ross J.
    McDiarmid, Colin
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 35 : 232 - 244
  • [25] FLOODING IN WEIGHTED SPARSE RANDOM GRAPHS
    Amini, Hamed
    Draief, Moez
    Lelarge, Marc
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 1 - 26
  • [26] LARGE HOLES IN SPARSE RANDOM GRAPHS
    FRIEZE, AM
    JACKSON, B
    COMBINATORICA, 1987, 7 (03) : 265 - 274
  • [27] Hamiltonian completions of sparse random graphs
    Gamarnik, D
    Sviridenko, M
    DISCRETE APPLIED MATHEMATICS, 2005, 152 (1-3) : 139 - 158
  • [28] Uniformly Random Colourings of Sparse Graphs
    Hurley, Eoin
    Pirot, Francois
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1357 - 1370
  • [29] Sparse Graphs: Metrics and Random Models
    Bollobas, Bela
    Riordan, Oliver
    RANDOM STRUCTURES & ALGORITHMS, 2011, 39 (01) : 1 - 38
  • [30] Sparse random graphs: Eigenvalues and eigenvectors
    Tran, Linh V.
    Vu, Van H.
    Wang, Ke
    RANDOM STRUCTURES & ALGORITHMS, 2013, 42 (01) : 110 - 134
12345