论文信息 - Bondary-connectivity via graph theory

Bondary-connectivity via graph theory

We generalize theorems of Kesten and Deuschel-Pisztora about the connectedness of the exterior boundary of a connected subset of $\Z^d$, where "connectedness" and "boundary" are understood with respect to various graphs on the vertices of $\Z^d$. 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.

Adam Timar | Ádám Timár

[1] G. Grimmett,et al. Entanglement in Percolation , 2000 .

[2] Ádám Timár,et al. Cutsets in Infinite Graphs , 2006, Combinatorics, Probability and Computing.

[3] Ãgoston Pisztora,et al. ON THE CHEMICAL DISTANCE FOR SUPERCRITICAL BERNOULLI PERCOLATION , 1996 .

[4] A. Hammond. Greedy lattice animals: Geometry and criticality , 2006 .

[5] H. Kesten. Aspects of first passage percolation , 1986 .

[6] J. Deuschel,et al. Surface order large deviations for high-density percolation , 1996 .

[7] Ãgoston Pisztora,et al. Surface order large deviations for Ising, Potts and percolation models , 1996 .

[8] Gabor Pete. A note on percolation on $Z^d$: isoperimetric profile via exponential cluster repulsion , 2007 .

[9] Yu Zhang,et al. The Probability of a Large Finite Cluster in Supercritical Bernoulli Percolation , 1990 .

[10] Rigidity of the Interface in Percolation and Random-Cluster Models , 2001, math/0109103.

[11] Eric Babson,et al. Cut sets and normed cohomology with applications to percolation , 1999 .