Sharp threshold for rigidity of random graphs

Research output: Contribution to journalArticlepeer-review

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 languageAmerican English
Pages (from-to)490-501
Number of pages12
JournalBulletin of the London Mathematical Society
Volume55
Issue number1
DOIs
StatePublished - 1 Feb 2023

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

Dive into the research topics of 'Sharp threshold for rigidity of random graphs'. Together they form a unique fingerprint.

Cite this