Triangulating the Circle, at Random

From MaRDI portal
Publication:4293898

DOI10.2307/2975599zbMath0804.52011OpenAlexW4256493770MaRDI QIDQ4293898

David J. Aldous

Publication date: 10 July 1994

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2975599




Related Items (23)

Dissecting the circle, at randomThe Markovian hyperbolic triangulationConvergence of uniform noncrossing partitions toward the Brownian triangulationRandom stable-type minimal factorizations of the n-cycleThe CRT is the scaling limit of random dissectionsRandom non-crossing plane configurations: A conditioned Galton-Watson tree approachThe shape of random pattern-avoiding permutationsSimply Generated Non-Crossing PartitionsRandom stable laminations of the diskRandom recursive triangulations of the disk via fragmentation theoryOn the number of large triangles in the Brownian triangulation and fragmentation processesA polynomial upper bound for the mixing time of edge rotations on planar mapsPolynomial mixing time of edge flips on quadrangulationsSelf-similar real trees defined as fixed points and their geometric propertiesA geometric representation of fragmentation processes on stable treesSpaces of algebraic measure trees and triangulations of the circleThe geometry of random minimal factorizations of a long cycle via biconditioned bitype random treesCounter examples to invariant circle packingThe dual tree of a recursive triangulation of the diskRandom generation and scaling limits of fixed genus factorizations into transpositionsAn efficient upper bound of the rotation distance of binary treesOn the Largest Common Subtree of Random Leaf-Labeled Binary TreesRayleigh processes, real trees, and root growth with re-grafting




This page was built for publication: Triangulating the Circle, at Random