English
Related papers

Related papers: Predictability, entropy and information of infinit…

200 papers

For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information transmission above which a given compact subset of the state…

Systems and Control · Electrical Eng. & Systems 2020-04-13 Mahendra Singh Tomar , Christoph Kawan , Pushpak Jagtap , Majid Zamani

We consider input-deterministic finite state transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality on infinite words. When these transducers are given by a strongly connected set of states,…

Formal Languages and Automata Theory · Computer Science 2019-04-22 Olivier Carton , Elisa Orduna

We study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…

Dynamical Systems · Mathematics 2024-07-11 Tamara Kucherenko , Martin Schmoll , Christian Wolf

Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…

Data Structures and Algorithms · Computer Science 2020-11-17 Michel Schellekens

Let $f$ be an holomorphic endomorphism of $\mathbb{C}\mathbb{P}^k$. We construct by using coding techniques a class of ergodic measures as limits of non-uniform probability measures on preimages of points. We show that they have large…

Dynamical Systems · Mathematics 2009-11-25 Christophe Dupont

This note examines the infinite divisibility of density-based transformations of normal random variables. We characterize a class of density-based transformations of normal variables which produces non-infinitely divisible distributions. We…

Statistics Theory · Mathematics 2011-08-03 A. Murillo-Salas , F. J. Rubio

We propose a compression-based version of the empirical entropy of a finite string over a finite alphabet. Whereas previously one considers the naked entropy of (possibly higher order) Markov processes, we consider the sum of the…

Information Theory · Computer Science 2011-04-05 Paul M. B. Vitányi

We provide examples of transitive partially hyperbolic dynamics (specific but paradigmatic examples of homoclinic classes) which blend different types of hyperbolicity in the one-dimensional center direction. These homoclinic classes have…

Dynamical Systems · Mathematics 2018-05-21 Lorenzo J. Díaz , Katrin Gelfert , Tiane Marcarini , Michał Rams

The almost sure convergence of ergodic averages in Birkhoff's pointwise ergodic theorem is known to fail in the finitely additive setting. We introduce a natural reformulation of almost sure convergence suitable for finitely additive…

Dynamical Systems · Mathematics 2025-11-05 Morenikeji Neri

We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…

Computational Complexity · Computer Science 2014-09-16 Vladimir V. V'yugin

We give a simple proof of the uncertainty principle with quantum side information, as in [Berta et al. Nature Physics 6, 659 (2010)], invoking the monotonicity of the relative entropy. Our proof shows that the entropic uncertainty principle…

Quantum Physics · Physics 2011-12-08 Patrick J. Coles , Li Yu , Michael Zwolak

The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x_1^n using the entropy of the k-block empirical probability and letting k grow with $n$ roughly like log n. We further assume that the…

Probability · Mathematics 2009-11-10 J. -R. Chazottes , D. Gabrielli

There are numerous characterizations of Shannon entropy and Tsallis entropy as measures of information obeying certain properties. Using work by Faddeev and Furuichi, we derive a very simple characterization. Instead of focusing on the…

Information Theory · Computer Science 2017-08-22 John C. Baez , Tobias Fritz , Tom Leinster

We study a notion of entropy for probability measure preserving actions of finitely generated free groups, called f-invariant entropy, introduced by Lewis Bowen. In the degenerate case, the f-invariant entropy is negative infinity. In this…

Dynamical Systems · Mathematics 2015-01-15 Brandon Seward

We answer positively a question of Ryzhikov, namely we show that being a relatively weakly mixing extension is a comeager property in the Polish group of measure preserving transformations. We study some related classes of ergodic…

Dynamical Systems · Mathematics 2021-09-07 Eli Glasner , Jean-Paul Thouvenot , Benjamin Weiss

We extend algorithmic conservation inequalities to probability measures. The amount of self information of a probability measure cannot increase when submitted to randomized processing. This includes (potentially non-computable) measures…

Computational Complexity · Computer Science 2024-09-12 Samuel Epstein

We develop information-theoretic measures of spatial structure and pattern in more than one dimension. As is well known, the entropy density of a two-dimensional configuration can be efficiently and accurately estimated via a converging…

Statistical Mechanics · Physics 2009-11-07 David P. Feldman , James P. Crutchfield

Given a uniformly expanding transitive Markov interval map, we show that within the set of ergodic measures the set of nonadapted ergodic measures is residual in with respect to the topology induced by the $\overline{d}$-metric. This set of…

Dynamical Systems · Mathematics 2026-02-23 Łukasz Krzywoń

The relationship between entropy and information is reviewed, taking into account that information is stored in macroscopic degrees of freedom, such as the order parameter in a system exhibiting spontaneous symmetry breaking. It is shown…

Statistical Mechanics · Physics 2009-10-31 Juan M. R. Parrondo

It is observed that the entropy reduction (the information gain in the initial terminology) of an efficient (ideal or pure) quantum measurement coincides with the generalized quantum mutual information of a q-c channel mapping an a priori…

Quantum Physics · Physics 2015-05-20 M. E. Shirokov