Related papers: Finitary coding for the sub-critical Ising model w…
It has been shown by van den Berg and Steif that the sub-critical and critical Ising model on $\mathbb{Z}^d$ is a finitary factor of an i.i.d. process (ffiid), whereas the super-critical model is not. In fact, they showed that the latter is…
We show that any finite-entropy, countable-valued finitary factor of an i.i.d process can also be expressed as a finitary factor of a finite-valued i.i.d process whose entropy is arbitrarily close to the target process. As an application,…
It is known that the Ising model on $\mathbb {Z}^d$ at a given temperature is a finitary factor of an i.i.d. process if and only if the temperature is at least the critical temperature. Below the critical temperature, the plus and minus…
A random field $X = (X_v)_{v \in G}$ on a quasi-transitive graph $G$ is a factor of i.i.d. if it can be written as $X=\varphi(Y)$ for some i.i.d. process $Y= (Y_v)_{v \in G}$ and equivariant map $\varphi$. Such a map, also called a coding,…
We study Gaussian concentration inequalities for random fields obtained as finitary codings of i.i.d.\ fields, linking concentration properties to coding structure. A finitary coding represents a dependent field as a shift-equivariant image…
We prove the existence of a finitely dependent proper colouring of the integer lattice Z^d that is fully isometry-invariant in law, for all dimensions d. Previously this was known only for d=1, while only translation-invariant examples were…
We establish new characterizations of amenability of graphs through two probabilistic notions: stochastic domination and finitary codings (also called finitary factors). On the stochastic domination side, we show that the plus state of the…
We rederive the finite size scaling formula for the apparent critical temperature by using Mean Field Theory for the Ising Model above the upper critical dimension. We have also performed numerical simulations in five dimensions and our…
We develop a method to prove that certain percolation processes on amenable random rooted graphs are factors of iid (fiid), given that the process is a monotone limit of random finite subgraphs that satisfy a certain independent stochastic…
Suppose that the vertices of ${\mathbb Z}^d$ are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex $v$ is determined by a rule that examines the labels…
We show that any finitely dependent invariant process on a transitive amenable graph is a finitary factor of an i.i.d. process. With an additional assumption on the geometry of the graph, namely that no two balls with different centers are…
We study the critical Ising model with free boundary conditions on finite domains in $\mathbb{Z}^d$ with $d\geq4$. Under the assumption, so far only proved completely for high $d$, that the critical infinite volume two-point function is of…
We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we…
A periodic Ising model is one endowed with interactions that are invariant under translations of members of a full-rank sublattice $\mathfrak{L}$ of $\mathbb{Z}^2$. We give an exact, quantitative description of the critical temperature,…
Holroyd and Liggett recently proved the existence of a stationary 1-dependent 4-coloring of the integers, the first stationary k-dependent q-coloring for any k and q. That proof specifies a consistent family of finite-dimensional…
Although the fully connected Ising model does not have a length scale, we show that its critical exponents can be found using finite size scaling with the scaling variable equal to N, the number of spins. We find that at the critical…
We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as finitary factors of i.i.d. processes with finite mean coding…
We show that the performance of critical quantum metrology protocols, counter-intuitively, can be enhanced by finite temperature. We consider a toy-model squeezing Hamiltonian, the Lipkin-Meshkov-Glick model and the paradigmatic Ising…
We consider a particle system on $Z^d$ with finite state space and interactions of infinite range. Assuming that the rate of change is continuous and decays sufficiently fast, we introduce a perfect simulation algorithm for the stationary…
The method of counting loops for calculating the partition function of the Ising model on the two dimensional square lattice is extended to lacunary planar lattices, especially scale invariant fractal lattices, the Sierpi\'nsky carpets with…