Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
arXiv:2202.08666 · doi:10.1214/23-AIHP1387
Abstract
We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly encoded by the depth-first walk (or Łukasiewicz path) of the tree, as opposed to the height or contour process for the tree. We then construct continuum analogues associated with any càdlàg path with no negative jump and derive several invariance principles. We especially focus on uniformly random looptrees and maps with prescribed face degrees and study their scaling limits in the presence of macroscopic faces, which complements a previous work in the case of no large faces. The limits (along subsequences for maps) form new families of random metric measured spaces related to processes with exchangeable increments with no negative jumps and our results generalise previous works which concerned the Brownian and stable Lévy bridges.
arXiv comment51 pages, 8 figures
References in corpus (15)
- 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
- Random stable looptrees
- Scaling limits of random planar maps with a unique large face
- Invariance principles for random bipartite planar maps
- The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
- Scaling limits of random bipartite planar maps with a prescribed degree sequence
- Bridges of Lévy processes conditioned to stay positive
- On scaling limits of planar maps with stable face-degrees
- On scaling limits of random trees and maps with a prescribed degree sequence
- Dini derivatives for Exchangeable Increment processes and applications
- Shifting processes with cyclically exchangeable increments at random