Boundary-connectivity via graph theory

DOI10.1090/S0002-9939-2012-11333-4zbMATH Open1259.05049arXiv0711.1713OpenAlexW2963081305MaRDI QIDQ4908261FDOQ4908261

Authors: Ádám Timár 

Publication date: 5 March 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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$. 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.

Full work available at URL: https://arxiv.org/abs/0711.1713

Recommendations

• scientific article; zbMATH DE number 124392
• On the connectivity of configuration graphs
• On the connectedness of a random graph
• scientific article; zbMATH DE number 3867370
• Bounds on probability of group connectedness of a random graph

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Infinite graphs (05C63) Geometric group theory (20F65)

Cites Work

• Rigidity of the interface in percolation and random-cluster models
• Surface order large deviations for high-density percolation
• Title not available (Why is that?)
• A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion
• Surface order large deviations for Ising, Potts and percolation models
• On the chemical distance for supercritical Bernoulli percolation
• Greedy lattice animals: geometry and criticality
• Cut sets and normed cohomology with applications to percolation
• The probability of a large cluster in supercritical Bernoulli perlocation
• Entanglement in percolation
• Cutsets in Infinite Graphs

Cited In (33)

• On the number and size of holes in the growing ball of first-passage percolation
• Transience of the vacant set for near-critical random interlacements in high dimensions
• Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
• The size of the boundary in first-passage percolation
• Phase transition for the speed of the biased random walk on the supercritical percolation cluster
• Quenched invariance principles for random walks and elliptic diffusions in random media with boundary
• Competitive erosion is conformally invariant
• On chemical distance and local uniqueness of a sufficiently supercritical finitary random interlacements
• Concentration inequalities for log-concave distributions with applications to random surface fluctuations
• Collapse and diffusion in harmonic activation and transport
• Existence of a phase transition in harmonic activation and transport
• A new look at the interfaces in percolation
• The growth constant of odd cutsets in high dimensions
• Long range order for three-dimensional random field Ising model throughout the entire low temperature regime
• Regularity of the time constant for a supercritical Bernoulli percolation
• Rigidity of 3-colorings of the discrete torus
• One-ended spanning trees and definable combinatorics
• High-fugacity expansion and crystallization in non-sliding hard-core lattice particle models without a tiling constraint
• Borel circle squaring
• Bounding \(\ell\)-edge-connectivity in edge-connectivity
• Isoperimetry in supercritical bond percolation in dimensions three and higher
• Formation of an interface by competitive erosion
• Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
• Boundary vertices in graphs
• Percolation of finite clusters and infinite surfaces
• Rigidity of proper colorings of \(\mathbb{Z}^d \)
• Random-field random surfaces
• Algorithmic Pirogov-Sinai theory
• Continuity for the asymptotic shape in the frog model with random initial configurations
• The time constant for Bernoulli percolation is Lipschitz continuous strictly above \(p_c\)
• Disconnection and level-set percolation for the Gaussian free field
• Measurable Hall's theorem for actions of abelian groups
• Rubber bands, convex embeddings and graph connectivity

This page was built for publication: Boundary-connectivity via graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908261)