Sharp threshold for rigidity of random graphs

From MaRDI portal
Publication:6135068

DOI10.1112/BLMS.12740zbMATH Open1519.05221arXiv2202.09917MaRDI QIDQ6135068FDOQ6135068

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

Publication date: 23 August 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Abstract: We consider the ErdH{o}s-R'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed dge1, we show that with high probability, the graph becomes rigid in mathbbRd at the very moment its minimum degree becomes d, and it becomes globally rigid in mathbbRd at the very moment its minimum degree becomes d+1.


Full work available at URL: https://arxiv.org/abs/2202.09917




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Sharp threshold for rigidity of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135068)