Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Boundary-connectivity via graph theory


Author: Ádám Timár
Journal: Proc. Amer. Math. Soc. 141 (2013), 475-480
MSC (2000): Primary 05C10, 05C63; Secondary 20F65, 60K35
DOI: https://doi.org/10.1090/S0002-9939-2012-11333-4
Published electronically: June 21, 2012
MathSciNet review: 2996951
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We generalize theorems of Kesten and Deuschel-Pisztora about the connectedness of the exterior boundary of a connected subset of $ \mathbb{Z}^d$, where ``connectedness'' and ``boundary'' are understood with respect to
various graphs on the vertices of $ \mathbb{Z}^d$. These theorems are widely used in statistical physics and related areas of probability. 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.


References [Enhancements On Off] (What's this?)

  • [AP] Antal, P. and Pisztora, Á. (1996) On the chemical distance for supercritical Bernoulli percolation, Ann. Probab. 24, no. 2, 1036-1048. MR 1404543 (98b:60168)
  • [BB] Babson, E. and Benjamini, I. (1999) Cut sets and normed cohomology with applications to percolation, Proc. Amer. Math. Soc. 127, 589-597. MR 1622785 (99g:05119)
  • [DP] Deuschel, J. and Pisztora, Á. (1996) Surface order large deviations for high-density percolation, Prob. Theory and Related Fields 104, 467-482. MR 1384041 (97d:60053)
  • [GG] Gielis, G. and Grimmett, G. (2002) Rigidity of the interface in percolation and random-cluster models, J. Stat. Phys. 109, 1-37. MR 1927913 (2003h:82037)
  • [H] Hammond, A. (2006) Greedy lattice animals: geometry and criticality, Ann. Probab. 34, no. 2, 593-637. MR 2223953 (2007b:60238)
  • [GH] Grimmett, G. and Holroyd, A. (2000) Entanglement in percolation, Proc. London Math. Soc. (3) 81, no. 2, 485-512. MR 1770617 (2001j:60185)
  • [K] Kesten, H. (1986) Aspects of first-passage percolation, in École d'été de probabilité de Saint-Flour XIV, Lecture Notes in Math. 1180, Springer-Verlag, 125-264. MR 876084 (88h:60201)
  • [KZ] Kesten, H. and Zhang, Y. (1990) The probability of a large finite cluster in supercritical Bernoulli percolation, Ann. Probab. 18, no. 2, 537-555. MR 1055419 (91i:60278)
  • [Pe] Pete, G. (2008) A note on percolation on $ \mathbb{Z}^d$: isoperimetric profile via exponential cluster repulsion, Elect. Comm. Probab. 13, 377-392. MR 2415145 (2010b:60272)
  • [Pi] Pisztora, Á. (1996) Surface order large deviations for Ising, Potts and percolation models, Probability Theory Rel. Fields 104, 427-466. MR 1384040 (97d:82016)
  • [T] Timár, Á. (2007) Cutsets in infinite graphs, Combin. Probab. and Comp. 16, issue 1, 159-166. MR 2286517 (2007j:05102)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2000): 05C10, 05C63, 20F65, 60K35

Retrieve articles in all journals with MSC (2000): 05C10, 05C63, 20F65, 60K35


Additional Information

Ádám Timár
Affiliation: Hausdorff Center for Mathematics, Universität Bonn, D-53115 Bonn, Germany
Email: adam.timar@hcm.uni-bonn.de

DOI: https://doi.org/10.1090/S0002-9939-2012-11333-4
Received by editor(s): March 25, 2010
Received by editor(s) in revised form: February 21, 2011, July 1, 2011, and July 5, 2011
Published electronically: June 21, 2012
Communicated by: Richard C. Bradley
Article copyright: © Copyright 2012 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.

American Mathematical Society