Sharpness of the phase transition for the corrupted compass model on transitive graphs

DOI10.1016/J.INDAG.2021.03.005MaRDI QIDQ2020441zbMATH OpenOpenAlexFDO

Authors Thomas Beekenkamp

Publication date 23 April 2021

Published in Indagationes Mathematicae. New Series (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionspercolationOSSS inequality

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Abstract: In the corrupted compass model on a vertex-transitive graph, a neighbouring edge of every vertex is chosen uniformly at random and opened. Additionally, with probability $p$, independently for every vertex, every neighbouring edge is opened. We study the size of open clusters in this model. Hirsch et al. have shown that for small $p$ all open clusters are finite almost surely, while for large $p$, depending on the underlying graph, there exists an infinite open cluster almost surely. We show that the corresponding phase transition is sharp, i.e., in the subcritical regime, all open clusters are exponentially small. Furthermore we prove a mean-field lower bound in the supercritical regime. The proof uses the by now well established method using the OSSS inequality. A second goal of this note is to showcase this method in an uncomplicated setting.

Recommendations

• Sharp phase transition for the random-cluster and Potts models via decision trees
• Sharpness for inhomogeneous percolation on quasi-transitive graphs
• Sharp phase transition in percolation via randomized algorithms [after Duminil-Copin, Raoufi, and Tassion]
• Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
• Sharp phase transition for the random-cluster model with summable external magnetic field

Cites work

• scientific article; zbMATH DE number 3996823 (Why is no real title available?)
• Analysis of Boolean Functions
• Sharp phase transition for the random-cluster and Potts models via decision trees
• Sharpness of the phase transition in percolation models
• The sharp phase transition for level set percolation of smooth planar Gaussian fields

Cited in

(4)

• Sharp dimension transition in a shortcut model
• Sharpness for inhomogeneous percolation on quasi-transitive graphs
• Sharpness of the phase transition for the orthant model
• Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs

This page was built for publication: Sharpness of the phase transition for the corrupted compass model on transitive graphs

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