asymptotic behaviour of large random stack triangulations
play

Asymptotic behaviour of large random stack-triangulations Marie - PowerPoint PPT Presentation

Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Asymptotic behaviour of large random stack-triangulations Marie Albenque et Jean-Franois Marckert LIAFA LABRI


  1. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Asymptotic behaviour of large random stack-triangulations Marie Albenque et Jean-François Marckert LIAFA – LABRI McGill University – February, 26th 2009

  2. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Outline Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives

  3. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Definition of planar maps • Planar map = planar connected graph embedded properly in the sphere up to a direct homomorphism of the sphere • Rooted planar map = an oriented edge ( e 0 , e 1 ) is marked, e 0 = root vertex. = = � = Map = Metric space with graph distance.

  4. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Definition of planar maps • Planar map = planar connected graph embedded properly in the sphere up to a direct homomorphism of the sphere • Rooted planar map = an oriented edge ( e 0 , e 1 ) is marked, e 0 = root vertex. = = � = Map = Metric space with graph distance.

  5. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Maps and faces Faces = connected components of the sphere without the edges or the map. Triangulation = map whose faces are all of degree 3. Quadrangulation = map whose faces are all of degree 4. Figure: Two quadrangulations and two triangulations

  6. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Random Apollonian networks – Stack-triangulations Stack-triangulations = triangulations obtained recursively: ◮ △ 2 k = (finite) set of stack-triangulations with 2 k faces.

  7. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Random Apollonian networks – Stack-triangulations Stack-triangulations = triangulations obtained recursively: ◮ △ 2 k = (finite) set of stack-triangulations with 2 k faces.

  8. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Random Apollonian networks – Stack-triangulations Stack-triangulations = triangulations obtained recursively: ◮ △ 2 k = (finite) set of stack-triangulations with 2 k faces.

  9. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Random Apollonian networks – Stack-triangulations Stack-triangulations = triangulations obtained recursively: ◮ △ 2 k = (finite) set of stack-triangulations with 2 k faces.

  10. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Random Apollonian networks – Stack-triangulations Stack-triangulations = triangulations obtained recursively: ◮ △ 2 k = (finite) set of stack-triangulations with 2 k faces.

  11. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Random Apollonian networks – Stack-triangulations Stack-triangulations = triangulations obtained recursively: ◮ △ 2 k = (finite) set of stack-triangulations with 2 k faces.

  12. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Stack-triangulations vs Triangulations { Stack-triangulations } � { Triangulations }

  13. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Convergence of large random planar maps • Large ? Number of vertices grows to infinity. • Random ? Which law ? • Convergence ? Which notion of convergence ? [Angel et Schramm, 03], [Chassaing et Schaeffer, 04], [Bouttier, Di Francesco, Guitter, 04], [Chassaing et Durhuss, 06], [Marckert et Mokkadem, 06], [Miermont, 06], [Marckert et Miermont, 07], [Le Gall, 07], [Le Gall et Paulin, 08], [Miermont et Weill, 08], [Chapuy, 08], [Bouttier et Guitter, 08], [Le Gall, 08]

  14. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Convergence of large random planar maps • Large ? Number of vertices grows to infinity. • Random ? Which law ? • Convergence ? Which notion of convergence ? [Angel et Schramm, 03], [Chassaing et Schaeffer, 04], [Bouttier, Di Francesco, Guitter, 04], [Chassaing et Durhuss, 06], [Marckert et Mokkadem, 06], [Miermont, 06], [Marckert et Miermont, 07], [Le Gall, 07], [Le Gall et Paulin, 08], [Miermont et Weill, 08], [Chapuy, 08], [Bouttier et Guitter, 08], [Le Gall, 08]

  15. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Convergence of large random planar maps • Large ? Number of vertices grows to infinity. • Random ? Which law ? • Convergence ? Which notion of convergence ? [Angel et Schramm, 03], [Chassaing et Schaeffer, 04], [Bouttier, Di Francesco, Guitter, 04], [Chassaing et Durhuss, 06], [Marckert et Mokkadem, 06], [Miermont, 06], [Marckert et Miermont, 07], [Le Gall, 07], [Le Gall et Paulin, 08], [Miermont et Weill, 08], [Chapuy, 08], [Bouttier et Guitter, 08], [Le Gall, 08]

  16. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Convergence of large random planar maps • Large ? Number of vertices grows to infinity. • Random ? Which law ? • Convergence ? Which notion of convergence ? [Angel et Schramm, 03], [Chassaing et Schaeffer, 04], [Bouttier, Di Francesco, Guitter, 04], [Chassaing et Durhuss, 06], [Marckert et Mokkadem, 06], [Miermont, 06], [Marckert et Miermont, 07], [Le Gall, 07], [Le Gall et Paulin, 08], [Miermont et Weill, 08], [Chapuy, 08], [Bouttier et Guitter, 08], [Le Gall, 08]

  17. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Two probability distributions △ 2 k = set of stack-triangulations with 2 k faces. Two natural probability distributions on △ 2 k : • the uniform law, denoted U △ 2 k , ◮ ◮ ◮ • the “historical” law, denoted Q △ 2 k : the probability of each map is proportional to its number of histories.

  18. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Two probability distributions △ 2 k = set of stack-triangulations with 2 k faces. Two natural probability distributions on △ 2 k : • the uniform law, denoted U △ 2 k , ◮ ◮ ◮ • the “historical” law, denoted Q △ 2 k : the probability of each map is proportional to its number of histories.

  19. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Two probability distributions △ 2 k = set of stack-triangulations with 2 k faces. Two natural probability distributions on △ 2 k : • the uniform law, denoted U △ 2 k , ◮ ◮ ◮ • the “historical” law, denoted Q △ 2 k : the probability of each map is proportional to its number of histories.

  20. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Two probability distributions △ 2 k = set of stack-triangulations with 2 k faces. Two natural probability distributions on △ 2 k : • the uniform law, denoted U △ 2 k , ◮ ◮ ◮ • the “historical” law, denoted Q △ 2 k : the probability of each map is proportional to its number of histories.

  21. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Two probability distributions △ 2 k = set of stack-triangulations with 2 k faces. Two natural probability distributions on △ 2 k : • the uniform law, denoted U △ 2 k , ◮ ◮ ◮ • the “historical” law, denoted Q △ 2 k : the probability of each map is proportional to its number of histories.

  22. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Two probability distributions △ 2 k = set of stack-triangulations with 2 k faces. Two natural probability distributions on △ 2 k : • the uniform law, denoted U △ 2 k , ◮ ◮ ◮ • the “historical” law, denoted Q △ 2 k : the probability of each map is proportional to its number of histories.

  23. Stack-triangulations Convergence of planar maps Uniform law and normalized convergence Other types of convergence Perpectives Two probability distributions △ 2 k = set of stack-triangulations with 2 k faces. Two natural probability distributions on △ 2 k : • the uniform law, denoted U △ 2 k , 3 1 • the “historical” law, denoted Q △ 2 k : the probability of each map is proportional to its number of histories.

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