






















We consider the Erdős-Rényi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$ at the very moment its minimum degree becomes $d$, and it becomes globally rigid in $\mathbb R^d$ at the very moment its minimum degree becomes $d+1$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。