BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//7.4.2//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:142@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240103T153000

DTEND;TZID=Asia/Jerusalem:20240103T163000

DTSTAMP:20250109T093606Z

URL:https://math.technion.ac.il/events/rigidity-and-d-dimensional-algebrai
 c-connectivity-of-graphs/

SUMMARY:Rigidity and d-dimensional algebraic connectivity of graphs
DESCRIPTION:Lecturer:Alan Lew\, Carnegie Mellon University\n Location:\n Li
 nk to the recorded talk (in panopto) \n&nbsp\;\n\nA d-dimensional framewo
 rk is a pair (G\,p) consisting of a graph G and an embedding p of its vert
 ex set into R^d. The framework is said to be rigid if there is no continuo
 us motion of the vertices of G\, starting from the positions prescribed by
  p\, that preserves the lengths of all edges (other than the trivial motio
 ns -- rotations and translations of the whole graph). Recently\, Jordán a
 nd Tanigawa introduced the d-dimensional algebraic connectivity of a graph
  G. This is a quantitative measure of the rigidity of G\, which generalize
 s the classical notion of spectral expansion of graphs (corresponding to t
 he d=1 case).\n\nIn this talk I will present several results on the rigidi
 ty and d-dimensional algebraic connectivity of graphs. In particular\, I w
 ill discuss the existence of "rigidity expander graphs" (infinite families
  of sparse graphs whose d-dimensional algebraic connectivity is bounded aw
 ay from zero)\, and show several new results on the rigidity of random gra
 phs.\nBased on joint work with Eran Nevo\, Yuval Peled and Orit Raz\, and 
 with Michael Krivelevich and Peleg Michaeli.\n https://technion.zoom.us/j/
 6550733370
CATEGORIES:Faculty Events,Seminars

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:STANDARD

DTSTART:20231029T010000

TZOFFSETFROM:+0300

TZOFFSETTO:+0200

TZNAME:IST

END:STANDARD

END:VTIMEZONE
END:VCALENDAR