BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Mikolaj Fraczyk (Chicago)
DTSTART:20220302T160000Z
DTEND:20220302T170000Z
DTSTAMP:20260423T035415Z
UID:WCS/50
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/50/">Sta
 tionary random graphs and groups</a>\nby Mikolaj Fraczyk (Chicago) as part
  of Warwick Combinatorics Seminar\n\n\nAbstract\nA stationary random graph
  is a random rooted graphs $(G\,o)$ such that replacing the root $o$ by it
 s random neighbor results in the same probability distribution. The more w
 ell known unimodular random graphs are always stationary\, but the unimodu
 larity assumption is in fact much stronger. Invariant random subgroups and
  unimodular random graphs are now a household name in measured group theor
 y\, and they found several applications in geometry and topology. In my ta
 lk I want to advertise and describe some applications of the stationary ra
 ndom graphs and groups. I will explain how they can be used to find non-ex
 pander sub-graphs inside any given graph and how to prove that any higher 
 rank locally symmetric space of infinite volume must have points of arbitr
 ary large injectivity radius. The talk is based on a joint work with Woute
 r Van Limbeek and with Tsachik Gelander.\n
LOCATION:https://researchseminars.org/talk/WCS/50/
END:VEVENT
END:VCALENDAR