Percolation and the hard-core lattice gas model

From MaRDI portal
Revision as of 12:04, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1316595

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




Related Items (47)

Hitting time asymptotics for hard-core interactions on gridsPerfect sampling using bounding chains.Random-cluster correlation inequalities for Gibbs fieldsOn the transition times in a loss model of wireless networksFractional v. integral covers in hypergraphs of bounded edge sizeErgodicity of the hard-core model on \(\mathbb{Z}^ 2\) with parity-dependent activitiesCoupling with the stationary distribution and improved sampling for colorings and independent setsNonmonotonicity of phase transitions in a loss network with controlsStrong spatial mixing for repulsive point processesRarity of extremal edges in random surfaces and other theoretical applications of cluster algorithmsOn phase transitions for subshifts of finite typeNon-uniqueness of measures of maximal entropy for subshifts of finite typeCoupling surfaces and weak Bernoulli in one and higher dimensionsRandom graphs from a weighted minor-closed classOdd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)Approximation Algorithms for the Random Field Ising ModelFast convergence of the Glauber dynamics for sampling independent setsImproved mixing condition on the grid for counting and sampling independent setsA note on disagreement percolationThe Number of Independent Sets in a Regular GraphRandom sampling for the monomer–dimer model on a latticeInduced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithmsOn maximal hard-core thinnings of stationary particle processesMetastability of hard-core dynamics on bipartite graphsApproximating entropy for a class of ℤ2Markov random fields and pressure for a class of functions on ℤ2shifts of finite typeApproximating the hard square entropy constant with probabilistic methodsThe repulsive lattice gas, the independent-set polynomial, and the Lovász local lemmaExact and approximate results for deposition and annihilation processes on graphsDisagreement percolation for the hard-sphere modelSampling independent sets in the discrete torusInvariant probability measures and dynamics of exponential linear type mapsA uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnetApproximating the partition function of planar two-state spin systemsPotts models in the continuum. Uniqueness and exponential decay in the restricted ensemblesPhase Coexistence for the Hard-Core Model on ℤ2Weighted counting of solutions to sparse systems of equationsOn the stochastic independence properties of hard-core distributionsGraph homomorphisms and phase transitionsGibbs measures and dismantlable graphsTunneling of the hard‐core model on finite triangular latticesFinitary codings for spatial mixing Markov random fieldsCounting stable sets on Cartesian products of graphsImproved Bounds on the Phase Transition for the Hard-Core Model in 2-DimensionsRandomly coloring constant degree graphsAgreement percolation and phase coexistence in some Gibbs systems.Uniform Sampling of Subshifts of Finite Type on Grids and TreesImproved inapproximability results for counting independent sets in the hard-core model




Cites Work




This page was built for publication: Percolation and the hard-core lattice gas model