Critical Percolation and the Minimal Spanning Tree in Slabs
From MaRDI portal
Publication:4588304
DOI10.1002/CPA.21714zbMATH Open1380.82025arXiv1512.09107OpenAlexW2962868918MaRDI QIDQ4588304FDOQ4588304
Charles M. Newman, Wei Wu, Vincent Tassion
Publication date: 2 November 2017
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Abstract: The minimal spanning forest on is known to consist of a single tree for and is conjectured to consist of infinitely many trees for large . In this paper, we prove that there is a single tree for quasi-planar graphs such as . Our method relies on generalizations of the "Gluing Lemma" of arXiv:1401.7130. 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 of diameter decays polynomially in . This strengthens the result of arXiv:1401.7130, where the absence of an infinite cluster at criticality was first established.
Full work available at URL: https://arxiv.org/abs/1512.09107
Cited In (9)
- Ground state stability in two spin glass models
- Emergent planarity in two-dimensional Ising models with finite-range interactions
- Geometry of the minimal spanning tree of a random 3-regular graph
- Crossing probabilities for planar percolation
- Crossing probabilities for critical Bernoulli percolation on slabs
- Quasi-independence for nodal lines
- The phase transitions of the random-cluster and Potts models on slabs with \(q \geq 1\) are sharp
- The scaling limits of the minimal spanning tree and invasion percolation in the plane
- Percolation of random nodal lines
This page was built for publication: Critical Percolation and the Minimal Spanning Tree in Slabs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4588304)