pith. sign in

arxiv: math/0605502 · v1 · submitted 2006-05-18 · 🧮 math.PR · math.LO

Zero-one laws for binary random fields

classification 🧮 math.PR math.LO
keywords binarylatticepotentialrandomtendszero-onebelongingbounded
0
0 comments X
read the original abstract

A set of binary random variables indexed by a lattice torus is considered. Under a mixing hypothesis, the probability of any proposition belonging to the first order logic of colored graphs tends to 0 or 1, as the size of the lattice tends to infinity. For the particular case of the Ising model with bounded pair potential and surface potential tending to $-\infty$, the threshold functions of local propositions are computed, and sufficient conditions for the zero-one law are given.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.