Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Sharp Threshold for Rigidity of Random Graphs

Institute for Pure & Applied Mathematics (IPAM) via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

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

Taught by

Institute for Pure & Applied Mathematics (IPAM)

Reviews

Start your review of Sharp Threshold for Rigidity of Random Graphs

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.