Related papers: Conditional entropy of ordinal patterns

The routine definitions of both entropy, and differential entropy show inconsistencies that make them not reciprocally coherent. We propose a few possible modifications of these quantities so that 1) they no longer show incongruities, 2)…

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…

We study the problem of discovering the simplest latent variable that can make two observed discrete variables conditionally independent. The minimum entropy required for such a latent is known as common entropy in information theory. We…

We propose new concepts in order to analyze and model the dependence structure between two time series. Our methods rely exclusively on the order structure of the data points. Hence, the methods are stable under monotone transformations of…

We present some new results which relate information to chaotic dynamics. In our approach the quantity of information is measured by the Algorithmic Information Content (Kolmogorov complexity) or by a sort of computable version of it…

We consider distributions of ordered random vectors with given one-dimensional marginal distributions. We give an elementary necessary and sufficient condition for the existence of such a distribution with finite entropy. In this case, we…

We study the problem of entropy increase of the Bernoulli-shift map without recourse to the concept of trajectory and we discuss whether, and under which conditions if it does, the distribution density entropy coincides with the…

Entropy estimation is a fundamental problem in information theory that has applications in various fields, including physics, biology, and computer science. Estimating the entropy of discrete sequences can be challenging due to limited data…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

The Kolmogorov-Sinai entropy in the sense of Tsallis under Bernoulli shifts was obtained by Meson and Vericat [J. Math. Phys. 37, 4480(1996)]. In this paper, we propose a revised generalized Kolmogorov-Sinai-q entropy under Markov shifts.…

Fluctuations of observables as functions of time, or "fluctuation patterns", are studied in a chaotic microscopically reversible system that has irreversibly reached a nonequilibrium stationary state. Supposing that during a certain, long…

Information theory on a time-discrete setting in the framework of time series analysis is generalized to the time-continuous case. Considerations of the Roessler and Lorenz dynamics as well as the Ornstein-Uhlenbeck process yield for…

In this paper we explore how non trivial boundary conditions could influence the entanglement entropy in a topological order in 2+1 dimensions. Specifically we consider the special class of topological orders describable by the quantum…

We give a hierarchy of many-parameter families of maps of the interval [0,1] with an invariant measure and using the measure, we calculate Kolmogorov--Sinai entropy of these maps analytically. In contrary to the usual one-dimensional maps…

Let $(X,d,f)$ be a topological dynamical system, where $(X,d)$ is a compact metric space and $f:X\to X$ is a continuous map. We define $n$-ordered empirical measure of $x\in X$ by \begin{align*}…

We propose an order parameter for a general one-dimensional gapped system with an open boundary condition. The order parameter can be computed from the ground state entanglement entropy of some regions near one of the boundaries. Hence, it…

For discrete-time stochastic processes, there is a close connection between return/waiting times and entropy. Such a connection cannot be straightforwardly extended to the continuous-time setting. Contrarily to the discrete-time case one…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

Shannon Entropy is the preeminent tool for measuring the level of uncertainty (and conversely, information content) in a random variable. In the field of communications, entropy can be used to express the information content of given…

The concept of the order parameter is extremely useful in physics. Here, I discuss extensions of this concept to cases when the order parameter is no longer a constant but fluctuates or oscillates in space and time. This allows one to…