Recurrence of weak graph limits

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=BDR5bZ_jy6I


Duration: 1:08:45
74 views
1

A result of Benjamini and Schramm states that the weak local limit (a.k.a. Benjamini-Schramm limit) of a sequence of planar graphs with uniformly bounded degrees is a.s. recurrent. We extend this results to limits of graphs excluding (any) fixed minor. Joint with Balazs Szegedy.



Other Videos By Microsoft Research


2016-09-06Developing the Best Life and Death Solver in Go
2016-09-06No Ifs, Ands, or Buts: Uncovering the Simplicity of Conditionals
2016-09-06Refinement of Thread-Modular Verification
2016-09-06Dependable Software via Automated Verification
2016-09-06GENI - Global Environment for Network Innovations
2016-09-06Welcome - Overview of the day
2016-09-06Mantis and JouleSort: Power Models and Metrics in Enterprise Computing
2016-09-06Explicit-Symbolic Modeling for Formal Verification
2016-09-06Wired Shut: Copyright and the Shape of Digital Culture
2016-09-06Accelerating Architectural-Level Full-System Multiprocessor Simulations using FPGAs
2016-09-06Recurrence of weak graph limits
2016-09-06Power series, power serious
2016-09-06Acoustic Analysis and Modeling of Pathological Voices
2016-09-06Data Clustering and Stability of Finite Samples
2016-09-06Bulldozers, Termites, and Chainsaws: Finding a Gradual Path to Parallelism
2016-09-06Gibbs Measures on Trees and Random Graphs
2016-09-06Discovering Heap Anomalies in the Wild
2016-09-06Giving Campaign lunch: Woodland Park Zoo
2016-09-06oPtions: The Secret Life of Steve Jobs [1/92]
2016-09-06(Computational) Linguistics and the Web: Hot research questions
2016-09-06Education for a Brighter Future


Tags:
microsoft research