Table of Contents
Fetching ...

Sharpness of the phase transition for constrained-degree percolation

Ivailo Hartarsky, Roger W. C. Silva

TL;DR

We study constrained-degree percolation (CDP) on ${\mathbb Z}^d$ with degree constraint ${\kappa}\in\{2,\dots,2d\}$. The main result establishes a sharp phase transition: in the subcritical regime $p<p_c$, the one-arm probability decays exponentially as $${\theta_n(p) \le e^{-\alpha_p n}}$$, and $p_c$ coincides with the susceptibility threshold ${\hat p_c}$. The proof combines the Duminil-Copin–Raoufi–Tassion randomized algorithm framework with an innovative pivotality-transfer mechanism based on a switching path to overcome lack of FKG and finite-energy properties. A modified one-arm event $E_n(p)$ with head/tail structure and a Russo formula underpin the transfer from $U$-pivotal to $p$-pivotal; this yields a differential inequality that implies sharpness and, via a standard corollary, exponential decay of cluster volumes in the subcritical phase. The techniques developed may apply to other dynamical or dependent percolation models lacking standard monotonicity properties.

Abstract

We consider constrained-degree percolation on the hypercubic lattice. Initially, all edges are closed, and each edge independently attempts to open at a uniformly distributed random time; the attempt succeeds if, at that instant, both end-vertices have degrees strictly less than a prescribed parameter. The absence of the FKG inequality and the finite energy property, as well as the infinite range of dependency, make the rigorous analysis of the model particularly challenging. In this work, we show that the one-arm probability exhibits exponential decay in its entire subcritical phase. The proof relies on the Duminil-Copin--Raoufi--Tassion randomized algorithm method and resolves a problem of dos Santos and the second author. At the heart of the argument lies an intricate combinatorial transformation of pivotality in the spirit of Aizenman--Grimmett essential enhancements, but with unbounded range. This technique may be of use in other dynamical settings.

Sharpness of the phase transition for constrained-degree percolation

TL;DR

We study constrained-degree percolation (CDP) on with degree constraint . The main result establishes a sharp phase transition: in the subcritical regime , the one-arm probability decays exponentially as , and coincides with the susceptibility threshold . The proof combines the Duminil-Copin–Raoufi–Tassion randomized algorithm framework with an innovative pivotality-transfer mechanism based on a switching path to overcome lack of FKG and finite-energy properties. A modified one-arm event with head/tail structure and a Russo formula underpin the transfer from -pivotal to -pivotal; this yields a differential inequality that implies sharpness and, via a standard corollary, exponential decay of cluster volumes in the subcritical phase. The techniques developed may apply to other dynamical or dependent percolation models lacking standard monotonicity properties.

Abstract

We consider constrained-degree percolation on the hypercubic lattice. Initially, all edges are closed, and each edge independently attempts to open at a uniformly distributed random time; the attempt succeeds if, at that instant, both end-vertices have degrees strictly less than a prescribed parameter. The absence of the FKG inequality and the finite energy property, as well as the infinite range of dependency, make the rigorous analysis of the model particularly challenging. In this work, we show that the one-arm probability exhibits exponential decay in its entire subcritical phase. The proof relies on the Duminil-Copin--Raoufi--Tassion randomized algorithm method and resolves a problem of dos Santos and the second author. At the heart of the argument lies an intricate combinatorial transformation of pivotality in the spirit of Aizenman--Grimmett essential enhancements, but with unbounded range. This technique may be of use in other dynamical settings.

Paper Structure

This paper contains 10 sections, 10 theorems, 32 equations.

Key Result

Theorem 1

Consider the CDP on ${\mathbb Z} ^d$, $d\geq 2$, with $\kappa\in\{2,\dots,2d\}$. For $p<p_{\mathrm{c}}$, there exists $\alpha_p>0$ such that for all $n\geq 1$, $\theta_n(p)\leq e^{-n\alpha_p}$.

Theorems & Definitions (27)

  • Theorem 1: Sharp phase transition
  • Remark 2
  • Corollary 3: Volume exponential decay
  • Definition 4: Modified one-arm
  • Definition 5: Pivotal
  • Lemma 6: Russo formula
  • proof
  • Lemma 7: Switching path
  • proof
  • Proposition 8: Pivotality transfer
  • ...and 17 more