Sharp Threshold for Rigidity of Random Graphs

Explore a 52-minute lecture on the sharp threshold for rigidity of random graphs presented by Yuval Peled from the Einstein Institute of Mathematics. Delve into the Erdos-Rényi evolution of random graphs, examining the critical moments when a graph becomes rigid and globally rigid. Discover how vertices placed generically in R^d behave as new edges are added, and learn about the conditions for preserving distances between adjacent vertices. Gain insights into the reconstruction of vertex embeddings from distance information. Understand the collaborative research efforts behind these findings and their implications for statistical mechanics beyond two dimensions.

Yuval Peled - Sharp Threshold for Rigidity of Random Graphs - IPAM at UCLA