The dual tree of a recursive triangulation of the disk

DOI10.1214/13-AOP894zbMath1355.60014arXiv1211.1343OpenAlexW2025426256MaRDI QIDQ2338914

Henning Sulzbach, Nicolas Broutin

Publication date: 27 March 2015

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.1343

zbMATH Keywords

functional limit theoremcontraction methodGromov-Hausdorff convergencereal tree

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Number-theoretic algorithms; complexity (11Y16) Asymptotic enumeration (05A16) Functional limit theorems; invariance principles (60F17)

Related Items (5)

Dissecting the circle, at random ⋮ Process convergence for the complexity of radix selection on Markov sources ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Self-similar real trees defined as fixed points and their geometric properties ⋮ Spaces of algebraic measure trees and triangulations of the circle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A limit process for partial match queries in random quadtrees and 2-d trees
• Random recursive triangulations of the disk via fragmentation theory
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The continuum random tree. I
• Random trees and applications
• Scaling limits of bipartite planar maps are homeomorphic to the 2-sphere
• Branching processes in Lévy processes: The exploration process
• Analytic variations on quadtrees
• Recursive self-similarity for random trees, random triangulations and Brownian excursion
• Parking arcs on the circle with applications to one-dimensional communication networks
• A general limit theorem for recursive algorithms and combinatorial structures
• The scaling limit of the minimum spanning tree of the complete graph
• The genealogy of self-similar fragmentations with negative index as a continuum random tree
• Asymptotic laws for nonconservative self-similar fragmentations
• Probabilistic and fractal aspects of Lévy trees
• Counting intervals in the packing process
• On a functional contraction method
• The continuum random tree. III
• The Markovian hyperbolic triangulation
• The quicksort process
• Random stable laminations of the disk
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• Partial match queries in two-dimensional quadtrees: a probabilistic approach
• Triangulating the Circle, at Random
• Noncrossing trees are almost conditioned Galton–Watson trees
• Partial Match Queries in Random Quadtrees
• Probability metrics and recursive algorithms
• Random Fragmentation and Coagulation Processes
• A limit theorem for “quicksort”
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
• Limit theorems for the number of maxima in random samples from planar regions

This page was built for publication: The dual tree of a recursive triangulation of the disk