Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Critical Percolation and the Minimal Spanning Tree in Slabs

Critical Percolation and the Minimal Spanning Tree in Slabs The minimal spanning forest on ℤd is known to consist of a single tree for d ≤ 2 and is conjectured to consist of infinitely many trees for large d. In this paper, we prove that there is a single tree for quasi‐planar graphs such as ℤ2 × {0,…,k}d−2. Our method relies on generalizations of the “gluing lemma” of Duminil‐Copin, Sidoravicius, and Tassion. A related result is that critical Bernoulli percolation on a slab satisfies the box‐crossing property. Its proof is based on a new Russo‐Seymour‐Welsh‐type theorem for quasi‐planar graphs. Thus, at criticality, the probability of an open path from 0 of diameter n decays polynomially in n. This strengthens the result of Duminil‐Copin et al., where the absence of an infinite cluster at criticality was first established. © 2017 Wiley Periodicals, Inc. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications on Pure & Applied Mathematics Wiley

Critical Percolation and the Minimal Spanning Tree in Slabs

Loading next page...
 
/lp/wiley/critical-percolation-and-the-minimal-spanning-tree-in-slabs-ETbYAg6sya

References (28)

Publisher
Wiley
Copyright
© 2017 Wiley Periodicals, Inc.
ISSN
0010-3640
eISSN
1097-0312
DOI
10.1002/cpa.21714
Publisher site
See Article on Publisher Site

Abstract

The minimal spanning forest on ℤd is known to consist of a single tree for d ≤ 2 and is conjectured to consist of infinitely many trees for large d. In this paper, we prove that there is a single tree for quasi‐planar graphs such as ℤ2 × {0,…,k}d−2. Our method relies on generalizations of the “gluing lemma” of Duminil‐Copin, Sidoravicius, and Tassion. A related result is that critical Bernoulli percolation on a slab satisfies the box‐crossing property. Its proof is based on a new Russo‐Seymour‐Welsh‐type theorem for quasi‐planar graphs. Thus, at criticality, the probability of an open path from 0 of diameter n decays polynomially in n. This strengthens the result of Duminil‐Copin et al., where the absence of an infinite cluster at criticality was first established. © 2017 Wiley Periodicals, Inc.

Journal

Communications on Pure & Applied MathematicsWiley

Published: Nov 1, 2017

There are no references for this article.