On scaling limits of planar maps with stable face-degrees
arXiv:1803.07899 · doi:10.30757/ALEA.v15-40
Abstract
We discuss the asymptotic behaviour of random critical Boltzmann planar maps in which the degree of a typical face belongs to the domain of attraction of a stable law with index . We prove that when conditioning such maps to have vertices, or edges, or faces, the vertex-set endowed with the graph distance suitably rescaled converges in distribution towards the celebrated Brownian map when , and, after extraction of a subsequence, towards another `-stable map' when , which improves on a first result due to Le Gall & Miermont who assumed slightly more regularity.
arXiv comment31 pages, 5 figures
References in corpus (10)
- Random trees and applications
- Uniqueness and universality of the Brownian map
- The topological structure of scaling limits of large planar maps
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- The scaling limit of uniform random plane maps, via the Ambjørn-Budd bijection
- Scaling limits of random planar maps with a unique large face
- Invariance principles for random bipartite planar maps
- A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees
- A Boltzmann approach to percolation on random triangulations
- Random walk on random infinite looptrees
Cited by in corpus (7)
- On scaling limits of random trees and maps with a prescribed degree sequence
- Large deviation Local Limit Theorems and limits of biconditioned Trees and Maps
- Planar maps and random partitions
- Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
- On the growth of random planar maps with a prescribed degree sequence
- Markovian explorations of random planar maps are roundish
- Distances on the , critical Liouville quantum gravity and -stable maps