University of Cambridge > > Combinatorics Seminar > Sparse graph convergence and where it goes

Sparse graph convergence and where it goes

Add to your list(s) Download to your calendar using vCal

  • UserMiklós Abért (Rényi Institute)
  • ClockThursday 02 June 2016, 16:00-17:00
  • HouseMR12.

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

Local sampling convergence of sparse graphs, also known as Benjamini-Schramm convergence, has received a lot of attention in the last 15 years. When building a bridge between finite and infinite, one is naturally lead to ask, how much mathematical energy is really traveling through it. Can the infinite proofs be just redone in the finite world? Do the finite proofs carry enough weight, or infinity lurking behind bounds their complexity level? Does finite or infinite take over and become the dominant language? I will give examples for and against these, mainly in the language of spectral theory. I will also present some distinguished open problems on entropy of cellular maps over groups, random regular graphs and stochastic processes. Solving these would push the subject to the next level.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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