Sharp threshold for rigidity of random graphs

Alan Lew, Eran Nevo, Yuval Peled*, Orit E. Raz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 - Feb 2023

Bibliographical note

Publisher Copyright:
© 2022 The Authors. Bulletin of the London Mathematical Society is copyright © London Mathematical Society.

Fingerprint

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

Cite this