Rigidity of Random Graphs | המחלקה למתמטיקה

Seminar

Speaker

Yuval Peled (Hebrew University)

Date

15/06/2025 - 13:00 - 12:00Add to Calendar 2025-06-15 12:00:28 2025-06-15 13:00:00 Rigidity of Random Graphs A graph G is said to be d-rigid if it admits an embedding into ℝ^d such that the only continuous motions of the vertices that preserve all edge lengths are induced by isometries of ℝ^d. A central question in rigidity theory—studied since the 1970s—is to determine which graphs are d-rigid.In this talk, we investigate the d-rigidity of Erdős–Rényi random graphs G(n, p), and explore the new techniques and challenges they bring to the field. Our main focus is the following question: What is the largest dimension d for which a random graph G(n, p) is d-rigid with high probability?Based on joint work with Alan Lew, Eran Nevo, Orit Raz, and Niv Peleg. Math seminar room (building 216, room 201) and also on-line via zoom with the link https://biu-ac-il.zoom.us/j/82747834707 אוניברסיטת בר-אילן - המחלקה למתמטיקה mathoffice@math.biu.ac.il Asia/Jerusalem public

Place

Math seminar room (building 216, room 201) and also on-line via zoom with the link https://biu-ac-il.zoom.us/j/82747834707

Abstract

A graph G is said to be d-rigid if it admits an embedding into ℝ^d such that the only continuous motions of the vertices that preserve all edge lengths are induced by isometries of ℝ^d. A central question in rigidity theory—studied since the 1970s—is to determine which graphs are d-rigid.

In this talk, we investigate the d-rigidity of Erdős–Rényi random graphs G(n, p), and explore the new techniques and challenges they bring to the field. Our main focus is the following question: What is the largest dimension d for which a random graph G(n, p) is d-rigid with high probability?

Based on joint work with Alan Lew, Eran Nevo, Orit Raz, and Niv Peleg.