Bondary-connectivity via graph theory
arXiv:0711.1713
Abstract
We generalize theorems of Kesten and Deuschel-Pisztora about the connectedness of the exterior boundary of a connected subset of , where "connectedness" and "boundary" are understood with respect to various graphs on the vertices of . We provide simple and elementary proofs of their results. It turns out that the proper way of viewing these questions is graph theory, instead of topology.
arXiv comment8 pages. Title of earlier version was: Some short proofs for connectedness of boundaries
Cited by in corpus (5)
- Odd cutsets and the hard-core model on Z^d
- Regularity of the time constant for a supercritical Bernoulli percolation
- Concentration estimates for the isoperimetric constant of the super critical percolation cluster
- Phase transition for the speed of the biased random walk on the supercritical percolation cluster
- A note on percolation on Z^d: isoperimetric profile via exponential cluster repulsion