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 条
12345