Boundary-connectivity via graph theory
From MaRDI portal
Publication:4908261
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3971949 (Why is no real title available?)
- A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion
- Cut sets and normed cohomology with applications to percolation
- Cutsets in Infinite Graphs
- Entanglement in percolation
- Greedy lattice animals: geometry and criticality
- On the chemical distance for supercritical Bernoulli percolation
- Rigidity of the interface in percolation and random-cluster models
- Surface order large deviations for Ising, Potts and percolation models
- Surface order large deviations for high-density percolation
- The probability of a large cluster in supercritical Bernoulli perlocation
Cited in
(33)- Competitive erosion is conformally invariant
- A new look at the interfaces in percolation
- On the number and size of holes in the growing ball of first-passage percolation
- Phase transition for the speed of the biased random walk on the supercritical percolation cluster
- On chemical distance and local uniqueness of a sufficiently supercritical finitary random interlacements
- Regularity of the time constant for a supercritical Bernoulli percolation
- High-fugacity expansion and crystallization in non-sliding hard-core lattice particle models without a tiling constraint
- Percolation of finite clusters and infinite surfaces
- The growth constant of odd cutsets in high dimensions
- The time constant for Bernoulli percolation is Lipschitz continuous strictly above \(p_c\)
- Borel circle squaring
- Rigidity of proper colorings of \(\mathbb{Z}^d \)
- Continuity for the asymptotic shape in the frog model with random initial configurations
- Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
- Rigidity of 3-colorings of the discrete torus
- Measurable Hall's theorem for actions of abelian groups
- Long range order for three-dimensional random field Ising model throughout the entire low temperature regime
- Transience of the vacant set for near-critical random interlacements in high dimensions
- Existence of a phase transition in harmonic activation and transport
- Isoperimetry in supercritical bond percolation in dimensions three and higher
- Formation of an interface by competitive erosion
- Disconnection and level-set percolation for the Gaussian free field
- Algorithmic Pirogov-Sinai theory
- Rubber bands, convex embeddings and graph connectivity
- Bounding \(\ell\)-edge-connectivity in edge-connectivity
- Concentration inequalities for log-concave distributions with applications to random surface fluctuations
- Random-field random surfaces
- One-ended spanning trees and definable combinatorics
- Quenched invariance principles for random walks and elliptic diffusions in random media with boundary
- The size of the boundary in first-passage percolation
- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
- Collapse and diffusion in harmonic activation and transport
- Boundary vertices in graphs
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)
