A percolation process on the square lattice where large finite clusters are frozen

DOI10.1002/rsa.20375zbMath1235.60144arXiv1006.2050OpenAlexW1988634841MaRDI QIDQ3119049

Pierre Nolin, Bernardo Nunes Borges de Lima, Jacob Van Den Berg

Publication date: 7 March 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

frozen clusterRusso-Seymour-Welsh technique

Mathematics Subject Classification ID

Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (7)

Two-dimensional volume-frozen percolation: deconcentration and prevalence of mesoscopic clusters ⋮ Percolation of finite clusters and shielded paths ⋮ Frozen percolation in two dimensions ⋮ Feller property of the multiplicative coalescent with linear deletion ⋮ Percolation with constant freezing ⋮ Linear de-preferential urn models ⋮ Frozen percolation on the binary tree is nonendogenous

Cites Work

• A percolation process on the binary tree where large finite clusters are frozen
• A signal-recovery system: asymptotic properties, and construction of an infinite-volume process.
• The percolation process on a tree where infinite clusters are frozen

This page was built for publication: A percolation process on the square lattice where large finite clusters are frozen