random planar maps growth fragmentations
play

Random planar maps & growth-fragmentations Igor Kortchemski - PowerPoint PPT Presentation

Random planar maps & growth-fragmentations Igor Kortchemski (joint work with J. Bertoin and N. Curien) CNRS & cole polytechnique Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Motivation What does a


  1. Random planar maps & growth-fragmentations Igor Kortchemski (joint work with J. Bertoin and N. Curien) CNRS & École polytechnique

  2. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Motivation What does a “typical” random surface look like? Igor Kortchemski Random planar maps & growth-fragmentations 1 / 672

  3. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations � Idea: construct a (two-dimensional) random surface as a limit of random discrete surfaces. Igor Kortchemski Random planar maps & growth-fragmentations 2 / 672

  4. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations � Idea: construct a (two-dimensional) random surface as a limit of random discrete surfaces. Consider n triangles, and glue them uniformly at random in such a way to get a surface homeomorphic to a sphere. Igor Kortchemski Random planar maps & growth-fragmentations 2 / 672

  5. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations � Idea: construct a (two-dimensional) random surface as a limit of random discrete surfaces. Consider n triangles, and glue them uniformly at random in such a way to get a surface homeomorphic to a sphere. Figure: A large random triangulation (simulation by Nicolas Curien) Igor Kortchemski Random planar maps & growth-fragmentations 2 / 672

  6. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  7. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. View T n as a compact metric space, by equipping its vertices with the graph distance. Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  8. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. View T n as a compact metric space, by equipping its vertices with the graph distance. Show that n − 1 / 4 · T n converges towards a random compact metric space (the Brownian map) Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  9. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. View T n as a compact metric space, by equipping its vertices with the graph distance. Show that n − 1 / 4 · T n converges towards a random compact metric space (the Brownian map), in distribution for the Gromov–Hausdorff topology. Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  10. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. View T n as a compact metric space, by equipping its vertices with the graph distance. Show that n − 1 / 4 · T n converges towards a random compact metric space (the Brownian map), in distribution for the Gromov–Hausdorff topology. Solved by Le Gall in 2011. Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  11. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. View T n as a compact metric space, by equipping its vertices with the graph distance. Show that n − 1 / 4 · T n converges towards a random compact metric space (the Brownian map), in distribution for the Gromov–Hausdorff topology. Solved by Le Gall in 2011. Since, many different models of discrete surfaces have been shown to converge to the Brownian map (Miermont, Beltran & Le Gall, Addario-Berry & Albenque, Bettinelli & Jacob & Miermont, Abraham) Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  12. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. View T n as a compact metric space, by equipping its vertices with the graph distance. Show that n − 1 / 4 · T n converges towards a random compact metric space (the Brownian map), in distribution for the Gromov–Hausdorff topology. Solved by Le Gall in 2011. Since, many different models of discrete surfaces have been shown to converge to the Brownian map (Miermont, Beltran & Le Gall, Addario-Berry & Albenque, Bettinelli & Jacob & Miermont, Abraham), using various techniques (in particular bijective codings by labelled trees). Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  13. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations The Brownian map Problem (Schramm at ICM ’06): Let T n be a random uniform triangulation of the sphere with n triangles. View T n as a compact metric space, by equipping its vertices with the graph distance. Show that n − 1 / 4 · T n converges towards a random compact metric space (the Brownian map), in distribution for the Gromov–Hausdorff topology. Solved by Le Gall in 2011. Since, many different models of discrete surfaces have been shown to converge to the Brownian map (Miermont, Beltran & Le Gall, Addario-Berry & Albenque, Bettinelli & Jacob & Miermont, Abraham), using various techniques (in particular bijective codings by labelled trees). (see Le Gall’s proceeding at ICM ’14 for more information and references) Igor Kortchemski Random planar maps & growth-fragmentations 3 / 672

  14. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations � Other motivations: – links with two dimensional Liouville Quantum Gravity (David, Duplantier, Garban, Kupianen, Maillard, Miller, Rhodes, Sheffield, Vargas, Zeitouni) c.f. the talks of Jason Miller, Scott Sheffield and Vincent Vargas. – study of random planar maps decorated with statistical physics models (Angel, Berestycki, Borot, Bouttier, Guitter, Chen, Curien, Gwynne, K., Laslier, Mao, Ray, Sheffield, Sun, Wilson), c.f. the talk by Gourab Ray. Igor Kortchemski Random planar maps & growth-fragmentations 4 / 672

  15. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Outline I. Boltzmann triangulations with a boundary II. Peeling explorations III. Cycles & growth-fragmentations Igor Kortchemski Random planar maps & growth-fragmentations 5 / 672

  16. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations I. Boltzmann triangulations with a boundary II. Peeling explorations III. Cycles & growth-fragmentations Igor Kortchemski Random planar maps & growth-fragmentations 6 / 672

  17. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Triangulations Igor Kortchemski Random planar maps & growth-fragmentations 7 / 672

  18. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Definitions A map is a finite connected graph properly embedded in the sphere (up to orientation preserving continuous deformations). Igor Kortchemski Random planar maps & growth-fragmentations 8 / − 8 / 3

  19. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Definitions A map is a finite connected graph properly embedded in the sphere (up to orientation preserving continuous deformations). Figure: Two identical triangulations. Igor Kortchemski Random planar maps & growth-fragmentations 8 / − 8 / 3

  20. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Definitions A map is a finite connected graph properly embedded in the sphere (up to orientation preserving continuous deformations). A map is a triangulation when all the faces are triangles. Figure: Two identical triangulations. Igor Kortchemski Random planar maps & growth-fragmentations 8 / − 8 / 3

  21. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Definitions A map is a finite connected graph properly embedded in the sphere (up to orientation preserving continuous deformations). A map is a triangulation when all the faces are triangles. A map is rooted when an oriented edge is distinguished. Figure: Two identical triangulations. Igor Kortchemski Random planar maps & growth-fragmentations 8 / − 8 / 3

  22. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Definitions A map is a finite connected graph properly embedded in the sphere (up to orientation preserving continuous deformations). A map is a triangulation when all the faces are triangles. A map is rooted when an oriented edge is distinguished. Figure: Two identical rooted triangulations. Igor Kortchemski Random planar maps & growth-fragmentations 8 / − 8 / 3

  23. Motivation Boltzmann triangulations Peeling explorations Growth-fragmentations Triangulations with a boundary Igor Kortchemski Random planar maps & growth-fragmentations 9 / − 8 / 3

Recommend


More recommend