Related papers: Class Degree and Relative Maximal Entropy
Ergodic Optimization is the process of finding invariant probability measures that maximize the integral of a given function. It has been conjectured that "most" functions are optimized by measures supported on a periodic orbit, and it has…
We look at the maximal entropy (MME) measure of the boundaries of connected components of the Fatou set of a rational map of degree greater than or equal to 2. We show that if there are infinitely many Fatou components, and if either the…
A {\it uniformly $p$-to-one endomorphism} is a measure-preserving map with entropy log $p$ which is almost everywhere $p$-to-one and for which the conditional expectation of each preimage is precisely $1/p$. The {\it standard} example of…
We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…
We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of…
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
Let $f : X\to X$ be a dominating meromorphic map on a compact K\"ahler manifold $X$ of dimension $k$. We extend the notion of topological entropy $h^l_{\mathrm{top}}(f)$ for the action of $f$ on (local) analytic sets of dimension $0\leq l…
Ergodic optimization aims to single out dynamically invariant Borel probability measures which maximize the integral of a given "performance" function. For a continuous self-map of a compact metric space and a dense set of continuous…
In this paper we introduce three notions of measure theoretical entropy of a measurable cover U in a measure theoretical dynamical system. Two of them were already introduced in [R] and the new one is defined only in the ergodic case. We…
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 discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…
We consider skew products $$T_\phi:X\times G\to X\times G,~~(x,g)\mapsto(F_1(x),g\;\!\phi(x)),$$ where $X$ is a compact manifold with probability measure, $G$ a compact Lie group with Lie algebra $\frak g$, $F_1:X\to X$ the time-one map of…
We introduce a class of continuous maps f of a compact metric space I admitting inducing schemes and describe the tower constructions associated with them. We then establish a thermodynamical formalism, i.e., describe a class of real-valued…
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the…
We generalize several results of the classical theory of Thermodynamic Formalism by considering a compact metric space $M$ as the state space. We analyze the shift acting on $M^\mathbb{N}$ and consider a general a-priori probability for…
The maximum entropy principle is largely used in thresholding and segmentation of images. Among the several formulations of this principle, the most effectively applied is that based on Tsallis non-extensive entropy. Here, we discuss the…
In this article, we introduce an ergodic optimization problem inspired by information theory, which can be presented informally as follows: given a factor map $\pi : (X, T) \to (Y, S)$ of topological dynamical systems, and a continuous…
We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural…
We develop a support theory for elementary supergroup schemes, over a field of positive characteristic $p\ge 3$, starting with a definition of a $\pi$-point generalising cyclic shifted subgroups of Carlson for elementary abelian groups and…