Abstract
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 (Formula presented.), we show that with high probability, the graph becomes rigid in (Formula presented.) at the very moment its minimum degree becomes (Formula presented.), and it becomes globally rigid in (Formula presented.) at the very moment its minimum degree becomes (Formula presented.).
Original language | American English |
---|---|
Pages (from-to) | 490-501 |
Number of pages | 12 |
Journal | Bulletin of the London Mathematical Society |
Volume | 55 |
Issue number | 1 |
DOIs | |
State | Published - 1 Feb 2023 |
All Science Journal Classification (ASJC) codes
- General Mathematics