On the scaling limits of planar percolation

From MaRDI portal
Publication:651004

DOI10.1214/11-AOP659zbMATH Open1231.60116arXiv1101.5820OpenAlexW2950019662WikidataQ101094288 ScholiaQ101094288MaRDI QIDQ651004FDOQ651004

Stanislav Smirnov, Christophe Garban, Oded Schramm

Publication date: 8 December 2011

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We prove Tsirelson's conjecture that any scaling limit of the critical planar percolation is a black noise. Our theorems apply to a number of percolation models, including site percolation on the triangular grid and any subsequential scaling limit of bond percolation on the square grid. We also suggest a natural construction for the scaling limit of planar percolation, and more generally of any discrete planar model describing connectivity properties.


Full work available at URL: https://arxiv.org/abs/1101.5820




Recommendations




Cites Work


Cited In (47)





This page was built for publication: On the scaling limits of planar percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651004)