Related papers: Entropy-efficient finitary codings

We introduce stochastic and quantum finite-state transducers as computation-theoretic models of classical stochastic and quantum finitary processes. Formal process languages, representing the distribution over a process's behaviors, are…

As part of a general theory for the isomorphism problem for actions of amenable groups, Ornstein and Weiss (J. Anal. Math. 48:1-141,1987) proved that any two Poisson point processes are isomorphic as measure-preserving actions. We give an…

We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…

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 study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…

In this article, we further develop the thermodynamic formalism of affine iterated function systems with countably many transformations by showing the existence and extending earlier characterisations of the equilibrium states of finite…

Classical ergodic theory for integer-group actions uses entropy as a complete invariant for isomorphism of IID (independent, identically distributed) processes (a.k.a. product measures). This theory holds for amenable groups as well.…

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

Let $F$ be a finite field of order $q$ and characteristic $p$. Let $\mathbb{Z}_F=F[t]$, $\mathbb{Q}_F=F(t)$, $\mathbb{R}_F=F((1/t))$ equipped with the discrete valuation for which $1/t$ is a uniformizer, and let…

In this note we recall the importance of the notion of a finitary isomorphism in the classification problem of dynamical systems.

The paper introduces the recent results related to an entropy functional on trajectories of a controlled diffusion process, and the information path functional (IPF), analyzing their connections to the Kolmogorov's entropy, complexity and…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

A definition of entropy via the Kolmogorov algorithmic complexity is discussed. As examples, we show how the meanfield theory for the Ising model, and the entropy of a perfect gas can be recovered. The connection with computations are…

We derive exact closed-form expressions for several sums leading to hyperbolic functions and discuss their applicability for studies of finite-size Ising spin chains. We show how they immediately lead to closed-form expressions for both…

Motivated by the study of the metastable stochastic Ising model at subcritical temperature and in the limit of a vanishing magnetic field, we extend the notion of ($\kappa$, $\lambda$)-capacities between sets, as well as the associated…

The time evolution of complex systems usually can be described through stochastic processes. These processes are measured at finite resolution, what necessarily reduces them to finite sequences of real numbers. In order to relate these data…

A Poisson system is a Poisson point process and a group action, together forming a measure-preserving dynamical system. Ornstein and Weiss proved Poisson systems over many amenable groups were isomorphic in their 1987 paper. We consider…

We show that any cadlag predictable process of finite variation is an a.s. limit of elementary predictable processes; it follows that predictable stopping times can be approximated `from below' by predictable stopping times which take…

We continue the study of Rokhlin entropy, an isomorphism invariant for probability-measure-preserving actions of countable groups introduced in Part I. In this paper we prove a non-ergodic finite generator theorem and use it to establish…

For any finite dimensional C*-algebra A with any trace vector {\vec s} whose components are rational numbers, we give an endomorphism {\Phi} of the hyperfinite II_1 factor R such that: forall k in {\mathbb N} {\Phi}^k (R)' \cap R= \otimes^k…