bijective approach to percolation on triangulations and
play

Bijective approach to percolation on triangulations and Liouville - PowerPoint PPT Presentation

Bijective approach to percolation on triangulations and Liouville quantum gravity Olivier Bernardi - Brandeis University Joint work with Nina Holden & Xin Sun MIT, March 2019 Percolation on triangulation CLE on Liouville Quantum Gravity


  1. Bijective approach to percolation on triangulations and Liouville quantum gravity Olivier Bernardi - Brandeis University Joint work with Nina Holden & Xin Sun MIT, March 2019

  2. Percolation on triangulation CLE on Liouville Quantum Gravity

  3. Percolation on triangulation “Random curves on a random surface” CLE on Liouville Quantum Gravity

  4. Kreweras excursion Percolation on triangulation 2D Brownian excursion CLE on Liouville Quantum Gravity

  5. Percolation on triangulations

  6. Percolation on a regular lattice Triangular lattice

  7. Percolation on a regular lattice Site percolation: Color vertices black or white with probability 1 / 2 .

  8. Percolation on a regular lattice A n × B n box Site percolation: Color vertices black or white with probability 1 / 2 . Questions: • Crossing probabilities ?

  9. Percolation on a regular lattice Site percolation: Color vertices black or white with probability 1 / 2 . Questions: • Crossing probabilities ? • Crossing probabilities ? • Law of interfaces ?

  10. Percolation on a regular lattice Site percolation: Color vertices black or white with probability 1 / 2 . Questions: • Crossing probabilities ? • Crossing probabilities ? • Law of interfaces ? • Mixing properties ?

  11. Triangulations (of the disk) Def. A triangulation of the disk is a decomposition into triangles.

  12. Triangulations (of the disk) Def. A triangulation of the disk is a decomposition into triangles (considered up to deformation). =

  13. Triangulations (of the disk) Def. A triangulation of the disk is a decomposition into triangles (considered up to deformation). (multiple edges allowed, loops forbidden)

  14. Triangulations (of the disk) Def. A triangulation of the disk is a decomposition into triangles (considered up to deformation). Def. A triangulation is rooted by marking an edge on the boundary.

  15. Percolation on triangulations We can consider percolation on random triangulations of the disk. ( k exterior vertices, n interior vertices; uniform probability)

  16. Percolation on triangulations We can consider percolation on random triangulations of the disk. ( k exterior vertices, n interior vertices; uniform probability) Same questions: • Crossing probabilities ? • Law of interfaces ? • Mixing properties ?

  17. Percolation on triangulations We can consider percolation on random triangulations of the disk. ( k exterior vertices, n interior vertices; uniform probability) Same questions: • Crossing probabilities ? • Law of interfaces ? • Mixing properties ? We can also consider infinite triangulations . Uniform Infinite Planar Triangulation [Angel,Schramm 04]

  18. Triangulations as a random surface Uniformly random triangulation with n triangles of side length n − 1 / 4 . (image by N. Curien) random triangulation

  19. Triangulations as a random surface Uniformly random triangulation with n triangles of side length n − 1 / 4 . (image by N. Curien) random triangulation Brownian map Theorem [LeGall 2013, Miermont 2013] ∗ Convergence in law as a metric space (Gromov-Hausdorff topology). Limit is random compact metric space (homeomorphic to 2D sphere) of Hausdorff dimension 4. ( ∗ for a different family of planar maps)

  20. Regular lattices Vs random lattices Is it interesting to make statistical mechanics on random lattices ?

  21. Regular lattices Vs random lattices Is it interesting to make statistical mechanics on random lattices ? Vs regular lattice random lattice

  22. Regular lattices Vs random lattices Is it interesting to make statistical mechanics on random lattices ? Vs regular lattice random lattice Yes! The “critical exponents” on regular Vs random lattices are related by KPZ formula [Knizhnik, Polyakov, Zamolodchikov].

  23. Regular lattices Vs random lattices Is it interesting to make statistical mechanics on random lattices ? Vs regular lattice random lattice Yes! The “critical exponents” on regular Vs random lattices are related by KPZ formula [Knizhnik, Polyakov, Zamolodchikov]. Yes! Critically weighted triangulations � family of random surfaces.

  24. Liouville Quantum Gravity (LQG) and Schramm–Loewner Evolution (SLE)

  25. What is . . . Liouville Quantum Gravity?

  26. What is . . . Liouville Quantum Gravity? (image by J. Miller) LQG is a random area measure µ on a C -domain related to the Gaussian free field

  27. What is . . . Liouville Quantum Gravity? 1D LQG µ = e γ h dx h 0 1 0 1 Brownian motion 1D LQG

  28. What is . . . Liouville Quantum Gravity? 1D LQG h n : [ n ] → R h = lim h n µ = e γ h dx 0 n 0 1 0 1 Random function Brownian motion 1D LQG chosen with probability proportional to n ( h ( i ) − h ( i − 1)) 2 � − 2 i =1 e

  29. What is . . . Liouville Quantum Gravity? µ = e γ h dxdy h n : [ n ] 2 → R h = lim h n Random function Gaussian Free Field LQG chosen with probability (a distribution) (area measure) proportional to ( h ( u ) − h ( v )) 2 � − 2 u ∼ v e

  30. What is . . . Liouville Quantum Gravity? µ = e γ h dxdy h n : [ n ] 2 → R h = lim h n γ ∈ [0 , 2] controls how wild LQG measure is. � Today: γ = 8 / 3 . ”pure gravity”

  31. What is... a SLE (Schramm–Loewner evolution)?

  32. What is... a SLE (Schramm–Loewner evolution)? SLE κ is a random (non-crossing, parametrized) curve in a C -domain.

  33. What is... a SLE (Schramm–Loewner evolution)? SLE κ is a random (non-crossing, parametrized) curve in a C -domain. The parameter κ determines how much the curve “wiggles”. SLE κ were introduced to describe the scaling limit of curves from statistical mechanics.

  34. What is... a SLE (Schramm–Loewner evolution)? SLE are characterized by: • Conformal invariance property • Markov domain property 0 1

  35. What is... a SLE (Schramm–Loewner evolution)? SLE are characterized by: • Conformal invariance property • Markov domain property φ conformal 0 1 0 1

  36. What is... a SLE (Schramm–Loewner evolution)? SLE are characterized by: • Conformal invariance property • Markov domain property ˜ φ conformal 1 0 1 0 e i √ κW ( t ) γ ( t ) Brownian

  37. What is... a SLE (Schramm–Loewner evolution)? Today: κ = 6 (percolation – characterized by target invariance)

  38. What is... a SLE (Schramm–Loewner evolution)? Today: κ = 6 (percolation – characterized by target invariance) Theorem [Smirnov 01]: Convergence. SLE 6

  39. What is... a SLE (Schramm–Loewner evolution)? Today: κ = 6 (percolation – characterized by target invariance) Theorem [Smirnov 01]: Convergence.

  40. What is... a SLE (Schramm–Loewner evolution)? Today: κ = 6 (percolation – characterized by target invariance) Theorem [Smirnov 01]: Convergence. Theorem [Camia, Newman 09]: Convergence. Conformal Loop Ensemble CLE 6

  41. The big conjecture

  42. The big conjecture LQG was introduced in physics as a model of random surface describing space-time evolution of strings. Riemann surface Riemann mapping

  43. The big conjecture Nice embedding Riemann mapping Related?

  44. The big conjecture Nice embedding Riemann mapping Related? [Miller, Sheffield 2016]: Equality as metric spaces

  45. The big conjecture Nice embedding Riemann mapping Related?

  46. Convergence results Percolation on random triangulation CLE on Liouville Quantum Gravity

  47. Convergence results Percolation on random triangulation some under nice embedding CLE on Liouville Quantum Gravity

  48. Thm [Bernardi, Holden, Sun]: Let ( M n , σ n ) uniformly random percolated triangulation of size n ( n interior vertices, √ n exterior vertices). There exist embeddings φ n : M n → D (and coupling) such that the following converge jointly in probability :

  49. Thm [Bernardi, Holden, Sun]: Let ( M n , σ n ) uniformly random percolated triangulation of size n ( n interior vertices, √ n exterior vertices). There exist embeddings φ n : M n → D (and coupling) such that the following converge jointly in probability : � • Area measure: vertex counting measure − 8 / 3 -LQG µ . → weak topology LQG √ φ n ( M n ) 8 / 3

  50. Thm [Bernardi, Holden, Sun]: Let ( M n , σ n ) uniformly random percolated triangulation of size n ( n interior vertices, √ n exterior vertices). There exist embeddings φ n : M n → D (and coupling) such that the following converge jointly in probability : � • Area measure: vertex counting measure − 8 / 3 -LQG µ . → embedded percolation cycles γ n 1 , γ n • Percolation cycles : 2 , . . . → CLE 6 loops γ 1 , γ 2 , . . . − uniform topology + LQG √ independent CLE 6 φ n ( M n , σ n ) 8 / 3

  51. Thm [Bernardi, Holden, Sun]: Let ( M n , σ n ) uniformly random percolated triangulation of size n ( n interior vertices, √ n exterior vertices). There exist embeddings φ n : M n → D (and coupling) such that the following converge jointly in probability : � • Area measure: vertex counting measure − 8 / 3 -LQG µ . → embedded percolation cycles γ n 1 , γ n • Percolation cycles : 2 , . . . → CLE 6 loops γ 1 , γ 2 , . . . − • Exploration tree : τ n → Branching SLE 6 τ . uniform topology on subtrees

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend