Percolation on random triangulations and stable looptrees

Nicolas Curien, Igor Kortchemski

Research output: Contribution to journalArticlepeer-review

Abstract

We study site percolation on Angel and Schramm’s uniform infinite planar triangulation. We compute several critical and near-critical exponents, and describe the scaling limit of the boundary of large percolation clusters in all regimes (subcritical, critical and supercritical). We prove in particular that the scaling limit of the boundary of large critical percolation clusters is the random stable looptree of index (Formula presented.), which was introduced in Curien and Kortchemski (Random stable looptrees. arXiv:1304.1044, 2014). We also give a conjecture linking looptrees of any index (Formula presented.) with scaling limits of cluster boundaries in random triangulations decorated with (Formula presented.) models.

Original languageEnglish
Pages (from-to)303-337
Number of pages35
JournalProbability Theory and Related Fields
Volume163
Issue number1-2
DOIs
Publication statusPublished - 1 Oct 2015

Keywords

  • Galton–Watson trees
  • Percolation
  • Random planar triangulations

Fingerprint

Dive into the research topics of 'Percolation on random triangulations and stable looptrees'. Together they form a unique fingerprint.

Cite this