Abstract
The cactus of a pointed graph is a discrete tree associated with this graph. Similarly, with every pointed geodesic metric space E, one can associate an R-tree called the continuous cactus of E. We prove under general assumptions that the cactus of random planar maps distributed according to Boltzmann weights and conditioned to have a fixed large number of vertices converges in distribution to a limiting space called the Brownian cactus, in the Gromov-Hausdorff sense. Moreover, the Brownian cactus can be interpreted as the continuous cactus of the so-called Brownian map. © 2013 Association des Publications de l'Institut Henri Poincaré.
Author supplied keywords
Cite
CITATION STYLE
Curien, N., Le Gall, J. F., & Miermont, G. (2013). The Brownian cactus I. Scaling limits of discrete cactuses. Annales de l’institut Henri Poincare (B) Probability and Statistics, 49(2), 340–373. https://doi.org/10.1214/11-AIHP460
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.