Triangulating the Circle, at Random
From MaRDI portal
Recommendations
Cited in
(27)- An efficient upper bound of the rotation distance of binary trees
- A polynomial upper bound for the mixing time of edge rotations on planar maps
- Self-similar real trees defined as fixed points and their geometric properties
- A geometric representation of fragmentation processes on stable trees
- Counter examples to invariant circle packing
- Random generation and scaling limits of fixed genus factorizations into transpositions
- Polynomial mixing time of edge flips on quadrangulations
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- The dual tree of a recursive triangulation of the disk
- The Markovian hyperbolic triangulation
- Random stable laminations of the disk
- Convergence of uniform noncrossing partitions toward the Brownian triangulation
- Inner angle of triangle on unit circle made of consecutive three points generated by chaotic map
- Random non-crossing plane configurations: a conditioned Galton-Watson tree approach
- The CRT is the scaling limit of random dissections
- Dissecting the circle, at random
- The shape of random pattern-avoiding permutations
- On the number of large triangles in the Brownian triangulation and fragmentation processes
- Spaces of algebraic measure trees and triangulations of the circle
- On the largest common subtree of random leaf-labeled binary trees
- Random stable-type minimal factorizations of the \(n\)-cycle
- Simply generated non-crossing partitions
- The permuton limit of random recursive separable permutations
- Random recursive triangulations of the disk via fragmentation theory
- Algebraic two-level measure trees
- Holographic tensor network for double-scaled SYK
- Rayleigh processes, real trees, and root growth with re-grafting
This page was built for publication: Triangulating the Circle, at Random
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4293898)