Related papers: Computing the topological entropy of unimodal maps
We give a survey of the entropy theory of interval maps as it can be analyzed using ergodic theory, especially measures of maximum entropy and periodic points. The main tools are (i) a version of Hofbauer's Markov diagram, (ii) the…
We prove that, under a mild summability condition on the growth of the derivative on critical orbits any piecewise monotone interval map possibly containing discontinuities and singularities with infinite derivative (cusp map) admits an…
We give entropy estimates for two canonical non commutative shifts on $C^*$-algebras associated to some topological graphs $E=(E^0,E^1,s,r)$, defined using a basis of the corresponding Hilbert bimodule $H(E)$. We compare their entropies…
We consider the attractor $\Lambda$ of a piecewise contracting map $f$ defined on a compact interval. If $f$ is injective, we show that it is possible to estimate the topological entropy of $f$ (according to Bowen's formula) and the…
Two general upper bounds on the topological entropy of nonlinear time-varying systems are established: one using the matrix measure of the system Jacobian, the other using the largest real part of the eigenvalues of the Jacobian matrix with…
In this paper we will develop a very general approach which shows that critical relations of holomorphic maps on the complex plane unfold transversally in a positively oriented way. We will mainly illustrate this approach to obtain…
In analogy to the topological entropy for continuous endomorphisms of totally disconnected locally compact groups, we introduce a notion of topological entropy for continuous endomorphisms of locally linearly compact vector spaces. We study…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
We present a topological method of obtaining the existence of infinite number of symmetric periodic orbits for systems with reversing symmetry. The method is based on covering relations. We apply the method to a four-dimensional reversible…
Measuring the average information that is necessary to describe the behaviour of a dynamical system leads to a generalization of the Kolmogorov-Sinai entropy. This is particularly interesting when the system has null entropy and the…
We apply the maximum entropy principle to construct the natural invariant density and Lyapunov exponent of one-dimensional chaotic maps. Using a novel function reconstruction technique that is based on the solution of Hausdorff moment…
Symplectic maps are routinely used to describe single-particle dynamics in circular accelerators. In the case of a linear accelerator map, the rotation number (the betatron frequency) can be easily calculated from the map itself. In the…
Graph maps that are homotopic to the identity and that permute the vertices are studied. Given a periodic point for such a map, a {\em rotation element} is defined in terms of the fundamental group. A number of results are proved about the…
A numerical code is described for constructing Doppler maps from the orbital variation of line profiles of (mass transfering) binaries. It uses an algorithm related to Richardson-Lucy iteration, and is much faster than the standard…
Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…
We study the asymptotic dynamics of piecewise contracting maps defined on a compact interval. For maps that are not necessarily injective, but have a finite number of local extrema and discontinuity points, we prove the existence of a…
We propose a mixed integer programming (MIP) model and iterative algorithms based on topological orders to solve optimization problems with acyclic constraints on a directed graph. The proposed MIP model has a significantly lower number of…
We present an analytical approach for describing spectrally constrained maximum entropy ensembles of finitely connected regular loopy graphs, valid in the regime of weak loop-loop interactions. We derive an expression for the leading two…
Maximum a posteriori (MAP) inference in discrete-valued Markov random fields is a fundamental problem in machine learning that involves identifying the most likely configuration of random variables given a distribution. Due to the…
We investigate the question of which growth rates are possible for the number of periodic points of a compact group automorphism. Our arguments involve a modification of Linnik's Theorem, concerning small prime numbers in arithmetic…