Random stable laminations of the disk

preprint2014arXivOpen access

Abstract

We study large random dissections of polygons. We consider random dissections of a regular polygon with nn sides, which are chosen according to Boltzmann weights in the domain of attraction of a stable law of index θ∈(1,2]θ\in(1,2]. As nn goes to infinity, we prove that these random dissections converge in distribution toward a random compact set, called the random stable lamination. If θ=2θ=2, we recover Aldous' Brownian triangulation. However, if θ∈(1,2)θ\in(1,2), large faces remain in the limit and a different random compact set appears. We show that the random stable lamination can be coded by the continuous-time height function associated to the normalized excursion of a strictly stable spectrally positive Lévy process of index θθ. Using this coding, we establish that the Hausdorff dimension of the stable random lamination is almost surely 2−1/θ2-1/θ.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.