Related papers: Maximizing entropy for power-free languages
The maximum entropy principle (MEP) apparently allows us to derive, or justify, fundamental results of equilibrium statistical mechanics. Because of this, a school of thought considers the MEP as a powerful and elegant way to make…
Boolean control networks (BCNs) are discrete-time dynamical systems with Boolean state-variables and inputs that are interconnected via Boolean functions. BCNs are recently attracting considerable interest as computational models for…
We show that minimal shifts with zero topological entropy are topologically conjugate to interval exchange transformations, generally infinite. When these shifts have linear factor complexity (linear block growth), the conjugate interval…
We consider the shift transformation on the space of infinite sequences over a finite alphabet endowed with the invariant product measure, and examine the presence of a \emph{hole} on the space. The holes we study are specified by the…
To illustrate Boltzmann's construction of an entropy function that is defined for a microstate of a macroscopic system, we present here the simple example of the free expansion of a one dimensional gas of non-interacting point particles.…
In this paper, we prove that finite-dimensional topological flows without fixed points and having a countable number of periodic orbits, have the small flow boundary property. This enables us to answer positively a question of Bowen and…
Let $X$ be an irreducible shift of finite type (SFT) of positive entropy, and let $B_n(X)$ be its set of words of length $n$. Define a random subset $\omega$ of $B_n(X)$ by independently choosing each word from $B_n(X)$ with some…
We define a notion of rank for words and subshifts that we call spacer rank, extending the notion of rank-one symbolic shifts of Gao and Hill. We construct infinite words of each finite spacer rank, of unbounded spacer rank, and show there…
We prove that the entropy map for countable Markov shifts of finite entropy is upper semi-continuous at ergodic measures. Note that the phase space is non-compact. Applications to systems that can be coded by these shifts, such as positive…
A `symbolic dynamical system' is a continuous transformation F:X-->X of a closed perfect subset X of A^V, where A is a finite set and V is countable. (Examples include subshifts, odometers, cellular automata, and automaton networks.) The…
This paper defines and discusses the dimension notion of topological slow entropy of any subset for Z^d actions. Also, the notion of measure-theoretic slow entropy for Z^d actions is presented, which is modified from Brin and Katok [2].…
Let $\mathcal{M}(X)$ be the space of Borel probability measures on a compact metric space $X$ endowed with the weak$^\ast$-topology. In this paper, we prove that if the topological entropy of a nonautonomous dynamical system…
A definition of the thermodynamic entropy based on the time-dependent probability distribution of the macroscopic variables is developed. When a constraint in a composite system is released, the probability distribution for the new…
An asymptotic scaling theory is presented using the conceptual basis of trapping-free subspace (i.e., orthogonal subspace) to establish the generic mechanism of optimal efficiency of excitation energy transfer (EET) in light-harvesting…
A subshift with linear block complexity has at most countably many ergodic measures, and we continue of the study of the relation between such complexity and the invariant measures. By constructing minimal subshifts whose block complexity…
We give a new type of sufficient condition for the existence of measures with maximal entropy for an interval map $f$, using some non-uniform hyperbolicity to compensate for a lack of smoothness of $f$. More precisely, if the topological…
We formulate a stochastic process, FiLex, as a mathematical model of lexicon entropy in deep learning-based emergent language systems. Defining a model mathematically allows it to generate clear predictions which can be directly and…
Maximum Entropy is a powerful concept that entails a sharp separation between relevant and irrelevant variables. It is typically invoked in inference, once an assumption is made on what the relevant variables are, in order to estimate a…
The paper proposes a new message passing algorithm for cycle-free factor graphs. The proposed "entropy message passing" (EMP) algorithm may be viewed as sum-product message passing over the entropy semiring, which has previously appeared in…
If each node of an idealized network has an equal capacity to efficiently exchange benefits, then the network's capacity to use energy is scaled by the average amount of energy required to connect any two of its nodes. The scaling factor…