Related papers: Computability of $\mathcal{G}$-Beroulli Measures a…
Let $(E,\mathcal E,\mu)$ be a measure space and $G\colon E\times E\to [0,\infty]$ be measurable. Moreover, let $\mathcal F\!_{ui}$ denote the set of all $q\in\mathcal E^+$ (measurable numerical functions $q\ge 0$ on $E$) such that…
We investigate in this work some situations where it is possible to estimate or determine the upper and the lower $q$-generalized fractal dimensions $D^{\pm}_{\mu}(q)$, $q\in\mathbb{R}$, of invariant measures associated with continuous…
It is well known that open dynamical systems can admit an uncountable number of (absolutely continuous) conditionally invariant measures (ACCIMs) for each prescribed escape rate. We propose and illustrate a convex optimisation based…
We develop a numerical approach for computing the additive, multiplicative and compressive convolution operations from free probability theory. We utilize the regularity properties of free convolution to identify (pairs of) `admissible'…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…
Measuring a nonlocal observable on a space-like separated quantum system is a resource-hungry and experimentally challenging task. Several theoretical measurement schemes have already been proposed to increase its feasibility, using a…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…
An analysis of quantum measurement is presented that relies on an information-theoretic description of quantum entanglement. In a consistent quantum information theory of entanglement, entropies (uncertainties) conditional on measurement…
In this paper we establish a dichotomy for the ergodic measures of maximal entropy for partially hyperbolic diffeomorphisms with one-dimensional compact center leaves which are virtually skew products over (transitive) Anosov homeomorphism.…
In this paper, we construct a class of random measures $\mu^{\mathbf{n}}$ by infinite convolutions. Given infinitely many admissible pairs $\{(N_{k}, B_{k})\}_{k=1}^{\infty}$ and a positive integral sequence…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
Empirical Mode Decomposition(EMD) is an adaptive data analysis technique for analyzing nonlinear and nonstationary data[1]. EMD decomposes the original data into a number of Intrinsic Mode Functions(IMFs)[1] for giving better physical…
The length-scale dependence of the dynamic entropy is studied in a molecular dynamics simulation of a binary Lennard-Jones liquid above the mode-coupling critical temperature $T_c$. A number of methods exist for estimating the entropy of…
The method of Maximum (relative) Entropy (ME) is used to translate the information contained in the known form of the likelihood into a prior distribution for Bayesian inference. The argument is guided by intuition gained from the…
We study suspension flows defined over sub-shifts of finite type with continuous roof functions. We prove the existence of suspension flows with uncountably many ergodic measures of maximal entropy. More generally, we prove that any…
Maximum-entropy ensembles are key primitives in statistical mechanics from which thermodynamic properties can be derived. Over the decades, several approaches have been put forward in order to justify from minimal assumptions the use of…
We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…
We discuss the properties of invariant measures corresponding to iterated function systems (IFSs) with place-dependent probabilities and compute their Renyi entropies, generalized dimensions, and multifractal spectra. It is shown that with…
In this paper, we are concerned with estimating the joint probability of random variables $X$ and $Y$, given $N$ independent observation blocks $(\boldsymbol{x}^i,\boldsymbol{y}^i)$, $i=1,\ldots,N$, each of $M$ samples…