Sharp threshold for rigidity of random graphs

被引：5
|
作者：
Lew, Alan [1 ]
Nevo, Eran [1 ]
Peled, Yuval [1 ]
Raz, Orit E. [1 ]
机构：
[1] Hebrew Univ Jerusalem, Einstein Inst Math, IL-91904 Jerusalem, Israel
来源：
BULLETIN OF THE LONDON MATHEMATICAL SOCIETY | 2023年 / 55卷 / 01期
关键词：
2-DIMENSIONAL RIGIDITY;
D O I：
10.1112/blms.12740
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We consider the Erdos-Renyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed d >= 1, we show that with high probability, the graph becomes rigid in R-d at the very moment its minimum degree becomes d, and it becomes globally rigid in R-d at the very moment its minimum degree becomes d+1.
引用
收藏
页码：490 / 501
页数：12
相关论文
共 50 条
  • [21] A sharp threshold for bootstrap percolation in a random hypergraph
    Morrison, Natasha
    Noel, Jonathan A.
    ELECTRONIC JOURNAL OF PROBABILITY, 2021, 26
  • [22] Sharp thresholds for Hamiltonicity in random intersection graphs
    Efthymiou, Charilaos
    Spirakis, Paul G.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (40-42) : 3714 - 3730
  • [23] A sharp threshold for a random constraint satisfaction problem
    Flaxman, AD
    DISCRETE MATHEMATICS, 2004, 285 (1-3) : 301 - 305
  • [24] A sharp threshold for collapse of the random triangular group
    Antoniuk, Sylwia
    Friedgut, Ehud
    Luczak, Tomasz
    GROUPS GEOMETRY AND DYNAMICS, 2017, 11 (03) : 879 - 890
  • [25] CONNECTIVITY THRESHOLD FOR RANDOM CHORDAL GRAPHS
    MCMORRIS, FR
    SCHEINERMAN, ER
    GRAPHS AND COMBINATORICS, 1991, 7 (02) : 177 - 181
  • [26] The threshold for jigsaw percolation on random graphs
    Bollobas, Bela
    Riordan, Oliver
    Slivken, Erik
    Smith, Paul
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (02):
  • [27] Intergroup networks as random threshold graphs
    Saha, Sudipta
    Ganguly, Niloy
    Mukherjee, Animesh
    Krueger, Tyll
    PHYSICAL REVIEW E, 2014, 89 (04):
  • [28] Random cliques in random graphs and sharp thresholds for F$$ F $$-factors
    Riordan, Oliver
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (04) : 619 - 637
  • [29] Sharp threshold for embedding balanced spanning trees in random geometric graphs (vol 107, pg 107, 2024)
    Diaz, Alberto Espuny
    Lichev, Lyuben
    Mitsche, Dieter
    Wesolek, Alexandra
    JOURNAL OF GRAPH THEORY, 2024, 107 (04) : 847 - 847
  • [30] A Sharp Threshold for a Random Version of Sperner's Theorem
    Balogh, Jozsef
    Krueger, Robert A.
    RANDOM STRUCTURES & ALGORITHMS, 2024,
12345