Related papers: Intrinsic ergodicity via obstruction entropies

We study extensions of the measure of maximal entropy to suitable compactifications of the parameter space and the moduli space of rational maps acting on the Riemann sphere. For parameter space, we consider a space which resolves the…

We endow the set of all invariant measures of a topological dynamical system with a metric $\bar{\rho}$, which induces a topology stronger than the the weak$^*$-topology. Then, we study the closedness of ergodic measures within a…

We characterize two of the most studied non-uniform hyperbolicity conditions for rational maps, semi-hyperbolicity and the topological Collet-Eckmann condition, in terms of the maximal entropy measure. Using the same tools in the proof of…

We construct SRB measures for endomorphisms satisfying conditions far weaker than the non-uniformly expansion. As a consequence, the definition of non-uniformly expanding map can be weakened. We also prove the existence of an absolutely…

We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…

We introduce a notion of a point-wise entropy of measures (i.e local entropy) called neutralized local entropy, and compare it with the Brin-Katok local entropy. We show that the neutralized local entropy coincides with Brin-Katok local…

We study the existence and uniqueness of equilibrium states for continuous flows on a compact, locally maximal invariant set under weak, non-uniform versions of specification, expansivity, and the Bowen property, further improving the…

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…

Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained system is limited by the combinatorial capacity of the system…

Consider the set of all sequences of $n$ outcomes, each taking one of $m$ values, that satisfy a number of linear constraints. If $m$ is fixed while $n$ increases, most sequences that satisfy the constraints result in frequency vectors…

Co-compact entropy is introduced as an invariant of topological conjugation for perfect mappings defined on any Hausdorff space(compactness and metrizability not necessarily required). This is achieved through the consideration of…

We establish a connection between barcode entropy and metric entropy. Namely, we show that the barcode entropy bounds the metric entropy from below for a measure from a specific class of invariant measures associated with a pair of…

We construct equilibrium states, including measures of maximal entropy, for a large (open) class of non-uniformly expanding maps on compact manifolds. Moreover, we study uniqueness of these equilibrium states, as well as some of their…

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

In this article, we pay attention to transitive dynamical systems having the shadowing property and the entropy functions are upper semicontinuous. As for these dynamical systems, when we consider ergodic optimization restricted on the…

We consider endomorphisms of a compact manifold which are expanding except for a finite number of points and prove the existence and uniqueness of a physical measure and its stochastical stability. We also characterize the zero-noise limit…

We consider entropy-optimal graphons associated with extreme and near-extreme constraints on the densities of edges and triangles. We prove that the optimizers for near-extreme constraints are unique and multipodal and are perturbations of…

This is an outline of work in progress. We study the conjecture that the topological entropy of a real cubic map depends ``monotonely'' on its parameters, in the sense that each locus of constant entropy in parameter space is a connected…

A power-free language is characterized by the number of symbols used and a limit on how many times a block of symbols can repeat consecutively. For certain values of these parameters, it is known that the number of legal words grows…

The phenomenon of entropy concentration provides strong support for the maximum entropy method, MaxEnt, for inferring a probability vector from information in the form of constraints. Here we extend this phenomenon, in a discrete setting,…