2014
DOI: 10.1051/proc/201444007
|View full text |Cite
|
Sign up to set email alerts
|

Dissecting the circle, at random

Abstract: Abstract. Random laminations of the disk are the continuous limits of random non-crossing configurations of regular polygons. We provide an expository account on this subject. Initiated by the work of Aldous on the Brownian triangulation, this field now possesses many characters such as the random recursive triangulation, the stable laminations and the Markovian hyperbolic triangulation of the disk. We will review the properties and constructions of these objects as well as the close relationships they enjoy w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…The metric space (T e , d e ) is almost surely a metric tree (see [LG06, Sections 2 and 3]). Curien [Cu14] asked the following question.…”
Section: Huy Tranmentioning
confidence: 99%
“…The metric space (T e , d e ) is almost surely a metric tree (see [LG06, Sections 2 and 3]). Curien [Cu14] asked the following question.…”
Section: Huy Tranmentioning
confidence: 99%
“…As an alternative with better compactness properties to Gromov-Hausdorff convergence of discrete trees, Curien suggested in [Cur14] to look at convergence of coding triangulations (in Hausdorff metric topology). He also proposed to read off a measured, ordered, topological tree from the limit triangulation, and sketched the construction as quotient w.r.t.…”
Section: Related Workmentioning
confidence: 99%
“…[CLG11,BS15,CK15]). Also more general -angulations and dissections have been considered which allow for encoding not necessarily binary trees ( [Cur14,CHK15]). Note, however, that the relation between triangulations and trees has never been made explicit, except for the finite case, where the tree is the dual graph.…”
Section: Introductionmentioning
confidence: 99%