BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Sparse graph convergence and where it goes - Miklós Abért (Rény
 i Institute)
DTSTART:20160602T150000Z
DTEND:20160602T160000Z
UID:TALK65531@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:Local sampling convergence of sparse graphs\, also known as Be
 njamini-Schramm convergence\, has received a lot of attention in the last 
 15 years. When building a bridge between finite and infinite\, one is natu
 rally lead to ask\, how much mathematical energy is really traveling\nthro
 ugh it. Can the infinite proofs be just redone in the finite world? Do the
  finite proofs carry enough weight\, or infinity lurking behind bounds the
 ir complexity level? Does finite or infinite take over and become the domi
 nant language? I will give examples for and against these\, mainly in the 
 language of spectral theory. I will also present some distinguished\nopen 
 problems on entropy of cellular maps over groups\, random regular graphs a
 nd stochastic processes. Solving these would push the subject to the next 
 level.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR