University of Cambridge > Talks.cam > Discrete Analysis Seminar > Convergence for sparse graphs and representations

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Convergence for sparse graphs and representations

Download to your calendar using vCal

  • UserTim Austin (University of Warwick)
  • ClockWednesday 30 April 2025, 13:30-15:00
  • HouseMR4, CMS.

If you have a question about this talk, please contact Julia Wolf .

Various modes of convergence can be defined to control the asymptotic `global’ properties of a growing sequence of sparse graphs. Variants of these that allow directed and labeled edges have appeared independently in the study of sofic entropy in ergodic theory. In both settings, the theory has run into fundamental open questions about the convergence of some basic examples, especially random regular graphs. In the first part, I will sketch some of these questions with their background. In the second part, I will describe some analogs for unitary representations that have answers in terms of operator algebras. I will also indicate some applications to the study of random matrices if time allows.

(A more elementary account of some of these topics will occupy the Mordell lecture on Thursday.)

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

David Building, Anglia-Ruskin University DELETED Cormack Room, University Centre, Granta Place, CB2 1RU, Mill Lane, United Kingdom

Other talks

Group Work Talk TBC title abstract tba Title to be confirmed The LMC-SMC System: A New Laboratory for Galaxy Evolution, Dynamics and Dark Matter Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity