Related papers: An invariant of finitary codes with finite expecte…

Let $f$ be an holomorphic endomorphism of $\mathbb{P}^k$ and $\mu$ be its measure of maximal entropy. We prove an Almost Sure Invariance Principle for the systems $(\mathbb{P}^k,f,\mu)$. Our class $\cal{U}$ of observables includes the…

The problem of what moments can exist for the coding radius of a finitary map between two i.i.d. processes, has been extensively studied in the case of $\mathbb{Z}$-processes. Here we treat this problem for factor maps between…

In 1977, Keane and Smorodinsky showed that there exists a finitary homomorphism from any finite-alphabet Bernoulli process to any other finite-alphabet Bernoulli process of strictly lower entropy. In 1996, Serafin proved the existence of a…

Heap monoids equipped with Bernoulli measures are a model of probabilistic asynchronous systems. We introduce in this framework the notion of asynchronous stopping time, which is analogous to the notion of stopping time for classical…

Sinai proved that a nonatomic ergodic measure-preserving system has any Bernoulli shift of no greater entropy as a factor. Given a Bernoulli shift, we show that any other Bernoulli shift that is of strictly less entropy and is…

In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…

In this paper we calculate the metric and folding entropies for a family of non-invertible symbolic dynamical systems $(\Sigma_{m_-,m_+}, \sigma_\phi)$ which generalizes the standard bilateral Bernoulli shifts. The space $\Sigma_{m_-,m_+}$…

An infinite sequence $\alpha$ over an alphabet $\Sigma$ is $\mu$-distributed w.r.t. a probability map $\mu$ if, for every finite string $w$, the limiting frequency of $w$ in $\alpha$ exists and equals $\mu(w)$. %We raise the question of how…

Consider a H\"older continuous potential $\phi$ defined on the full shift $A^\nn$, where $A$ is a finite alphabet. Let $X\subset A^\nn$ be a specified sofic subshift. It is well-known that there is a unique Gibbs measure $\mu_\phi$ on $X$…

A {\it uniformly $p$-to-one endomorphism} is a measure-preserving map with entropy log $p$ which is almost everywhere $p$-to-one and for which the conditional expectation of each preimage is precisely $1/p$. The {\it standard} example of…

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…

We prove that if $G$ is a countably infinite group and $(L, \lambda)$ and $(K, \kappa)$ are probability spaces having equal Shannon entropy, then the Bernoulli shifts $G \curvearrowright (L^G, \lambda^G)$ and $G \curvearrowright (K^G,…

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…

To any positive contraction $Q$ on $\ell^2(W)$, there is associated a determinantal probability measure ${\mathbf P}^Q$ on $2^W$, where $W$ is a denumerable set. Let $\Gamma$ be a countable sofic finitely generated group and $G = (\Gamma,…

We study the length of the longest increasing and longest decreasing subsequences of random permutations drawn from the Mallows measure. Under this measure, the probability of a permutation pi in S_n is proportional to q^{inv(pi)} where q…

We prove that a shift ergodic measure on a topologically mixing sub-shift is isomorphic to a Bernoulli shift whenever it is quasi invariant under permutations of finite number of coordinates. We prove also that Gibbs measures on…

A consequence of Ornstein theory is that the infinite entropy flows associated with Poisson processes and continuous-time irreducible Markov chains on a finite number of states are isomorphic as measure-preserving systems. We give an…

Permutation entropy quantifies the diversity of possible orderings of the values a random or deterministic system can take, as Shannon entropy quantifies the diversity of values. We show that the metric and permutation entropy…

We establish a variant of the log-Sobolev and transport-information inequalities for mixture distributions. If a probability measure $\pi$ can be decomposed into components that individually satisfy such inequalities, then any measure $\mu$…

A result of Chebyshev (1864) and Hoeffding1956}, on bounding an expectation of a given function with respect to a Bernoulli convolution (also called Poisson binomial law, or law of the number of successes in independent trials) with any…