Related papers: Permutation Complexity via Duality between Values …
We analyze the effects of noise on the permutation entropy of dynamical systems. We take as numerical examples the logistic map and the R\"ossler system. Upon varying the noise strengthfaster, we find a transition from an…
Recurrence rate, determinism, average line length, and entropy of line lengths are measures of complexity in recurrence quantification analysis, that help to understand the structure, predictability and complexity of dynamical systems. In…
A quantity of interest to characterise continuous-valued stochastic processes is the differential entropy rate. The rate of convergence of many properties of LRD processes is slower than might be expected, based on the intuition for…
It has recently been suggested that various entanglement measures for bipartite mixed states do not in general give the same ordering even in the asymptotic cases [S. Virmani and M. B. Plenio, Phys. Lett. A {\bf 268}, 31 (2000)]. That is,…
We study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability $p<1/2$. We use this process as prototype for the behaviour of randomized, comparison-based optimization heuristics in…
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our…
Random permutation set (RPS) is a new formalism for reasoning with uncertainty involving order information. Measuring the conflict between two pieces of evidence represented by permutation mass functions remains an open issue in…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
We consider a closed quantum system subject to a stochastic resetting process. The generic expression for the resulting density operator is formulated for arbitrary resetting dynamics, fully characterised by the distribution of times…
When an experimentalist measures a time series of qubits, the outcomes generate a classical stochastic process. We show that measurement induces high complexity in these processes in two specific senses: they are inherently unpredictable…
It is shown that the inert properties of a stationary random process can be expressed in terms of the ratio of its correlation interval to the doubled variance. When using a fixed value of the Planck constant h as a proportionality factor,…
Duality is an indispensable tool for describing the strong-coupling dynamics of gauge theories. However, its actual realization is often quite subtle: quantities such as the partition function can transform covariantly, with degrees of…
In this paper we consider the convergence of the conditional entropy to the entropy rate for Markov chains. Convergence of certain statistics of long range dependent processes, such as the sample mean, is slow. It has been shown in Carpio…
Computers are deterministic dynamical systems (CHAOS 19:033124, 2009). Among other things, that implies that one should be able to use deterministic forecast rules to predict their behavior. That statement is sometimes-but not always-true.…
We propose to examine the predictability and the complexity characteristics of the Standard&Poor500 dynamics behaviors in a coarse-grained way using the symbolic dynamics method and under the prism of the Information theory through the…
We discuss the relationship between discrete-time processes (chains) and one-dimensional Gibbs measures. We consider finite-alphabet (finite-spin) systems, possibly with a grammar (exclusion rule). We establish conditions for a stochastic…
The estimation of entropy rates for stationary discrete-valued stochastic processes is a well studied problem in information theory. However, estimating the entropy rate for stationary continuous-valued stochastic processes has not received…
Let $X$ be a discrete random variable with support $S$ and $f : S \to S^\prime$ be a bijection. Then it is well-known that the entropy of $X$ is the same as the entropy of $f(X)$. This entropy preservation property has been well-utilized to…
We study stochastic particle systems with stationary product measures that exhibit a condensation transition due to particle interactions or spatial inhomogeneities. We review previous work on the stationary behaviour and put it in the…
We study the von Neumann and R\'enyi bipartite entanglement entropies in the thermodynamic limit of many-body quantum states with spin-s sites, that possess full symmetry under exchange of sites. It turns out that there is essentially a…