Automorphisms of Graphons
Channel:
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=8Gpgsb2oJG0
4Convergent dense sequences of graphs and their limit objects called graphons were introduced by Borgs, Chayes, Lovasz, Sos, Szegedy and Vesztergombi. Many directions of study of finite graphs extend to the study of graphons, and often yield interesting, even surprising results. In this talk we discuss the automorphism group of graphons. We prove that after an appropriate “standardization” of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on k-tuples of points. Among applications we study the graph algebras defined by finite rank graphons and the space of node-transitive graphons. This is joint work with Balazs Szegedy.
Other Videos By Microsoft Research
| 2016-06-21 | MSR Theory Day - Part 2 |
| 2016-06-21 | Theory Day Session 2 |
| 2016-06-21 | Modular Total Correctness Verification of Fine-Grained Concurrent Programs with Exceptions and I/O |
| 2016-06-21 | MSR NYC Data Science Seminar Series #2 |
| 2016-06-21 | MSR Theory Day - Part 3 |
| 2016-06-21 | Engineering Serendipity |
| 2016-06-21 | Operationalizing Predictive Model |
| 2016-06-21 | Theory Day Session 1 |
| 2016-06-21 | On understanding types, data abstraction and effects |
| 2016-06-21 | Interdisciplinarity: A View from Theoretical Computer Science |
| 2016-06-21 | Automorphisms of Graphons |
| 2016-06-21 | Theory Day Session 5 |
| 2016-06-21 | Finitely Dependent Coloring |
| 2016-06-21 | Squared Distance Matrix of a Tree |
| 2016-06-21 | Near Future Laboratory |
| 2016-06-21 | Luca Cardelli and the Early Evolution of ML |
| 2016-06-21 | How abstract should abstract types be? |
| 2016-06-21 | Deadlock analysis of unbounded process networks |
| 2016-06-21 | Full reduction in the face of absurdity |
| 2016-06-21 | A Brief Introduction to Microsoft Research |
| 2016-06-21 | Networked Publics as Third Places |
Tags:
microsoft research