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

  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

Sparse graph convergence and where it goes

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

WiSETI Faculty of Classics Room 611, EEE

Other talks

Pancreatic cancer - the clinical challenge;  Why the microenvironment matters during pancreatic cancer progression and treatment Title to be confirmed Talk title TBC Title to be confirmed Zooming in on the assembly of galaxies in the early Universe EVERSE Research Software Quality Kit
 

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