Percolation and the hard-core lattice gas model

DOI10.1016/0304-4149(94)90132-5zbMath0787.60125OpenAlexW2078000356MaRDI QIDQ1316595

Jeffrey E. Steif, Jacob Van Den Berg

Publication date: 10 April 1994

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1496

zbMATH Keywords

percolation communication networks ferromagnetic Ising model uniqueness condition for Gibbs measures

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Related Items

Hitting time asymptotics for hard-core interactions on grids, Perfect sampling using bounding chains., Random-cluster correlation inequalities for Gibbs fields, On the transition times in a loss model of wireless networks, Fractional v. integral covers in hypergraphs of bounded edge size, Ergodicity of the hard-core model on \(\mathbb{Z}^ 2\) with parity-dependent activities, Coupling with the stationary distribution and improved sampling for colorings and independent sets, Nonmonotonicity of phase transitions in a loss network with controls, Strong spatial mixing for repulsive point processes, Rarity of extremal edges in random surfaces and other theoretical applications of cluster algorithms, On phase transitions for subshifts of finite type, Non-uniqueness of measures of maximal entropy for subshifts of finite type, Coupling surfaces and weak Bernoulli in one and higher dimensions, Random graphs from a weighted minor-closed class, Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\), Approximation Algorithms for the Random Field Ising Model, Fast convergence of the Glauber dynamics for sampling independent sets, Improved mixing condition on the grid for counting and sampling independent sets, A note on disagreement percolation, The Number of Independent Sets in a Regular Graph, Random sampling for the monomer–dimer model on a lattice, Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms, On maximal hard-core thinnings of stationary particle processes, Metastability of hard-core dynamics on bipartite graphs, Approximating entropy for a class of ℤ²Markov random fields and pressure for a class of functions on ℤ²shifts of finite type, Approximating the hard square entropy constant with probabilistic methods, The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma, Exact and approximate results for deposition and annihilation processes on graphs, Disagreement percolation for the hard-sphere model, Sampling independent sets in the discrete torus, Invariant probability measures and dynamics of exponential linear type maps, A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet, Approximating the partition function of planar two-state spin systems, Potts models in the continuum. Uniqueness and exponential decay in the restricted ensembles, Phase Coexistence for the Hard-Core Model on ℤ², Weighted counting of solutions to sparse systems of equations, On the stochastic independence properties of hard-core distributions, Graph homomorphisms and phase transitions, Gibbs measures and dismantlable graphs, Tunneling of the hard‐core model on finite triangular lattices, Finitary codings for spatial mixing Markov random fields, Counting stable sets on Cartesian products of graphs, Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions, Randomly coloring constant degree graphs, Agreement percolation and phase coexistence in some Gibbs systems., Uniform Sampling of Subshifts of Finite Type on Grids and Trees, Improved inapproximability results for counting independent sets in the hard-core model

Cites Work