Related papers: Entropy-efficient finitary codings
We develop the analysis of finite element approximations of implicit power-law-like models for viscous incompressible fluids. The Cauchy stress and the symmetric part of the velocity gradient in the class of models under consideration are…
We introduce a model of simple type theory with potential infinite carrier sets. The functions in this model are automatically continuous, as defined in this paper. This notion of continuity does not rely on topological concepts, including…
This paper is a study of Glasner's definition of quasi-factors in the setting of infinite-measure preserving system. The existence of a system with zero Krengel entropy and a quasi-factor with positive entropy is obtained. On the other…
In a prior paper, the author generalized the classical factor theorem of Sinai to actions of arbitrary countably infinite groups. In the present paper, we use this theorem and the techniques of its proof in order to study connections…
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…
We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…
This work comprises a detailed theoretical and computational study of the boundary value problem for transversely isotropic linear elastic bodies. General conditions for well-posedness are derived in terms of the material parameters. The…
We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of epsilon-machines. We characterize epsilon-machines in the language of automata theory and adapt a recent algorithm for…
We consider a particle system on $Z^d$ with finite state space and interactions of infinite range. Assuming that the rate of change is continuous and decays sufficiently fast, we introduce a perfect simulation algorithm for the stationary…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
In this paper we propose a Monte Carlo method for generating finite-domain marginals of critical distributions of statistical models in infinite volume. The algorithm corrects the problem of the long-range effects of boundaries associated…
In this paper, we introduce the notions of lowerable, D-lowerable, P-lowerable, hereditarily lowerable, and hereditarily uniformly lowerable for countably infinite amenable group actions. We show that a system with finite entropy is…
The problem of Shannon entropy estimation in countable infinite alphabets is addressed from the study and use of convergence results of the entropy functional, which is known to be discontinuous with respect to the total variation distance…
In this work we consider an ensemble of random $\mathbb{Z}^d$-shifts of finite type ($\mathbb{Z}^d$-SFTs) and prove several results concerning the behavior of typical systems with respect to emptiness, entropy, and periodic points. These…
Kolmogorov-Sinai entropy is an invariant of measure-preserving actions of the group of integers that is central to classification theory. There are two recently developed invariants, sofic entropy and Rokhlin entropy, that generalize…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
This paper presents a command-line tool, called Entropia, that implements a family of conformance checking measures for process mining founded on the notion of entropy from information theory. The measures allow quantifying classical…
We prove that, consistently with ZFC, no ultraproduct of countably infinite (or separable metric, non-compact) structures is isomorphic to a reduced product of countable (or separable metric) structures associated to the Fr\'echet filter.…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
We consider random labelings of finite graphs conditioned on a small fixed number of peaks. We introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals. Next we…