Regular $g$-measures are discrete-time processes determined by conditional expectations with respect to the past. One-dimensional Gibbs measures, on the other hand, are fields determined by simultaneous conditioning on past and future. For the Markovian and exponentially continuous cases both theories are known to be equivalent. Its equivalence for more general cases was an open problem. We present a simple example settling this issue in a negative way: there exist $g$-measures that are continuous and non-null but are not Gibbsian. Our example belongs, in fact, to a well-studied family of processes with rather nice attributes: It is a chain with variable-length memory, characterized by the absence of phase coexistence and the existence of a visible renewal scheme
3 April 2013 in Ergodic Theory and Dynamical Systems
We prove that uniqueness of the stationary chain, or equivalently, of the $g$ -measure, compatible with an attractive regular probability kernel is equivalent to either one of the following two assertions for this chain: (1) it is a finitary coding of an independent and identically distributed (i.i.d.) process with countable alphabet; (2) the concentration of measure holds at exponential rate. We show in particular that if a stationary chain is uniquely defined by a kernel that is continuous and attractive, then this chain can be sampled using a coupling-from-the-past algorithm. For the original Bramson–Kalikow model we further prove that there exists a unique compatible chain if and only if the chain is a finitary coding of a finite alphabet i.i.d. process. Finally, we obtain some partial results on conditions for phase transition for general chains of infinite order.
1 September 2011 in Advances in Applied Probability
We present a new perfect simulation algorithm for stationary chains having unbounded variable length memory. This is the class of infinite memory chains for which the family of transition probabilities is represented by a probabilistic context tree. We do not assume any continuity condition: our condition is expressed in terms of the structure of the context tree. More precisely, the length of the contexts is a deterministic function of the distance to the last occurrence of some determined string of symbols. It turns out that the resulting class of chains can be seen as a natural extension of the class of chains having a renewal string. In particular, our chains exhibit a visible regeneration scheme.
25 February 2015 in Journal of Statistical Physics
We prove that g-functions whose set of discontinuity points has strictly negative topological pressure and which satisfy an assumption that is weaker than non-nullness, have at least one stationary g-measure. We also obtain uniqueness by adding conditions on the set of continuity points.