BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Convergence for sparse graphs and representations - Tim Austin (Un
 iversity of Warwick)
DTSTART:20250430T123000Z
DTEND:20250430T140000Z
UID:TALK230938@talks.cam.ac.uk
CONTACT:Julia Wolf
DESCRIPTION:Various modes of convergence can be defined to control the asy
 mptotic `global' properties of a growing sequence of sparse graphs.  Varia
 nts of these that allow directed and labeled edges have appeared independe
 ntly in the study of sofic entropy in ergodic theory.  In both settings\, 
 the theory has run into fundamental open questions about the convergence o
 f some basic examples\, especially random regular graphs.  In the first pa
 rt\, I will sketch some of these questions with their background.  In the 
 second part\, I will describe some analogs for unitary representations tha
 t have answers in terms of operator algebras.  I will also indicate some a
 pplications to the study of random matrices if time allows.\n\n(A more ele
 mentary account of some of these topics will occupy the Mordell lecture on
  Thursday.)\n
LOCATION:MR4\, CMS
END:VEVENT
END:VCALENDAR