LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Infinitesimal Containment and Sparse Factors of iid
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Infinitesimal Containment and Sparse Factors of iid

76 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
IAS

Mikołaj Frączyk of Jagiellonian University, Krakow, gives this joint IAS/Princeton University Groups and Dynamics Seminar on measured group theory. He opens with a distributed computing picture: a countable group Γ acting on its Cayley graph, with an independent random algorithm running at each vertex that can only communicate with neighbors, trying to pick out a large independent set or a small connected subgraph. These outputs are called sparse factor of iid subsets, and Frączyk asks what geometric shapes such subsets can take. He introduces the notion of one measure preserving action being infinitesimally contained in another, shows the Bernoulli shift is always infinitesimally contained in Γ's action on itself, and uses this to prove that in Cayley graphs of linear groups, sparse factor of iid subsets can be cut into finite pieces by deleting a small proportion of vertices, with consequences for lattices in semisimple Lie groups. The talk connects computer science intuition to dynamics and ties into estimating the cost of group actions.

At a glance

Lecture facts

Runtime compared with the other 734 Mathematics lectures
Runtime1 h 16 m
Compared with MathematicsLonger than 66%
Source channelInstitute for Advanced Study (YouTube)