University of Cambridge > Talks.cam > Combinatorics Seminar > Essential Expansion is Forceable

  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

Essential Expansion is Forceable

Download to your calendar using vCal

  • UserGabor Kun (Rényi Institute)
  • ClockWednesday 16 November 2016, 14:30-15:30
  • HouseMR5.

If you have a question about this talk, please contact Andrew Thomason .

We say that a sequence of bounded degree graphs is locally (Benjamini-Schramm) convergent if for every r the probability distribution on the isomorphism classes of rooted r-balls obtained by picking a vertex x uniformly at random and considering the r-ball centred at x converges in distribution. Not much is known about approximation of large graphs by small ones. We do not even know if every Cayley graph can be approximated by finite graphs: This is the famous problem if every group is sofic.

We prove Bowen’s conjecture that for every group G with Kazhdan Property (T) if a sequence of bounded degree graphs locally converges to a Cayley graph of G then the sequence is essentially a vertex-disjoint union of expander graphs. We characterize such sequences in terms of the Markov operator.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar & FW11, Computer Laboratory, William Gates Building. Venue TBC Life Sciences and Society Seminars

Other talks

External Seminar - Hilde Nelissen TBC Using Light for Cancer Detection Cambridge Reading Group on Reproduction: Professor Sara Brill Scattering Plenty: the people who made the modern countryside Good and Evil Plasma Cells: Guardians & Saboteurs of Immunity The Magic of Magnetism
 

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