Sandwiching random graphs: universality between random graph models

被引：37
|
作者：
Kim, JH
Vu, VH
机构：
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
[2] Microsoft Corp, Microsoft Res, Redmond, WA 98052 USA
来源：
ADVANCES IN MATHEMATICS | 2004年 / 188卷 / 02期
基金：
美国国家科学基金会;
关键词：
random graphs; universality;
D O I：
10.1016/j.aim.2003.10.007
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The goal of this paper is to establish a connection between two classical models of random graphs: the random graph G(n,p) and the random regular graph G(d)(n). This connection appears to be very useful in deriving properties of one model from the other and explains why many graph invariants are universal. In particular, one obtains one-line proofs of several highly non-trivial and recent results on G(d)(n). (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码：444 / 469
页数：26
相关论文
共 50 条
  • [1] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    [J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 690 - 701
  • [2] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 690 - 701
  • [3] Sandwiching dense random regular graphs between binomial random graphs
    Pu Gao
    Mikhail Isaev
    Brendan D. McKay
    [J]. Probability Theory and Related Fields, 2022, 184 : 115 - 158
  • [4] Sandwiching dense random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    [J]. PROBABILITY THEORY AND RELATED FIELDS, 2022, 184 (1-2) : 115 - 158
  • [5] Correction: Sandwiching dense random regular graphs between binomial random graphs
    Pu Gao
    Mikhail Isaev
    Brendan D. McKay
    [J]. Probability Theory and Related Fields, 2023, 187 : 517 - 517
  • [6] Sandwiching biregular random graphs
    Klimosova, Tereza
    Reiher, Christian
    Rucinski, Andrzej
    Sileikis, Matas
    [J]. COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (01) : 1 - 44
  • [7] On the Universality of Graph Neural Networks on Large Random Graphs
    Keriven, Nicolas
    Bietti, Alberto
    Vaiter, Samuel
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [8] Sandwiching dense random regular graphs between binomial random graphs (vol 184, 115, 2022)
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    [J]. PROBABILITY THEORY AND RELATED FIELDS, 2023, 187 (1-2) : 517 - 517
  • [9] Universality of Random Graphs
    Dellamonica, Domingos, Jr.
    Kohayakawa, Yoshiharu
    Roedl, Vojtech
    Rucinski, Andrzej
    [J]. PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 782 - 788
  • [10] UNIVERSALITY OF RANDOM GRAPHS
    Dellamonica, Domingos, Jr.
    Kohayakawa, Yoshiharu
    Roedl, Vojtech
    Rucinski, Andrzej
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (01) : 353 - 374
12345