相关论文: Constant slope, entropy and horseshoes for a map o…

We study continuous countably piecewise monotone interval maps, and formulate conditions under which these are conjugate to maps of constant slope, particularly when this slope is given by the topological entropy of the map. We confine our…

We study countably monotone and Markov interval maps. We establish sufficient conditions for uniqueness of a conjugate map of constant slope. We explain how global window perturbation can be used to generate a large class of maps satisfying…

We consider topological Markov chains (also called Markov shifts) on countable graphs. We show that a transient graph can be extended to a recurrent graph of equal entropy which is either positive recurrent of null recurrent, and we give an…

For a transitive countably piecewise monotone Markov interval map we consider the question whether there exists a conjugate map of constant slope. The answer varies depending on whether the map is continuous or only piecewise continuous,…

We explore the dynamics of graph maps with zero topological entropy. It is shown that a continuous map $f$ on a topological graph $G$ has zero topological entropy if and only if it is locally mean equicontinuous, that is the dynamics on…

We study the pointwise perturbations of countable Markov maps with infinitely many inverse branches and establish the following continuity theorem: Let $T_k$ and $T$ be expanding countable Markov maps such that the inverse branches of $T_k$…

We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $\mathbb{X}$ equipped with a continuous function $f: \mathbb{X} \rightarrow \mathbb{R}$. We first give a categorification of the…

We show that the (Gurevich) topological entropy for the countable Markov shift associated with an infinite transition matrix $A$ coincides with the non-commutative topological entropy for the Exel--Laca algebra associated with $A$, under…

Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamical systems. In this paper, we…

We study countably piecewise continuous, piecewise monotone interval maps. We establish a necessary and sufficient criterion for the existence of a nondecreasing semiconjugacy to a map of constant slope in terms of the existence of an…

For a continuous self-map $f$ on a compact interval $I$ and the induced map $\hat f$ on the space $\mathcal{M}(I)$ of probability measures, we obtain a sharp condition to guarantee that $(I,f)$ is transitive if and only if…

It is well known that a continuous piecewise monotone interval map with positive topological entropy is semiconjugate to a map of a constant slope and the same entropy, and if it is additionally transitive then this semiconjugacy is…

We consider a class $\mathcal{F}$ of Markov multi-maps on the unit interval. Any multi-map gives rise to a space of trajectories, which is a closed, shift-invariant subset of $[0,1]^{\mathbb{Z}_+}$. For a multi-map in $\mathcal{F}$, we show…

A well-known result of Bill Parry shows that a topologically transitive continuous piecewise monotone mapping with positive topological entropy is conjugate to a uniformly piecewise linear mapping with slope determined by the entropy. In…

A continuum $X$ is a dendrite if it is locally connected and contains no simple closed curve, a self mapping $f$ of $X$ is called monotone if the preimage of any connected subset of $X$ is connected. If $X$ is a dendrite and $f:X\to X$ is a…

We propose a novel method for topological analysis of unweighted graphs which is based on \textit{persistent homology}. The proposed method maps the input graph to a complete weighted graph where the weighting function maps each edge to a…

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…

In connection with the Entropy Conjecture it is known that the topological entropy of a continuous graph map is bounded from below by the spectral radius of the induced map on the first homology group. We show that in the case of a…

We introduce the notion of a one-way horseshoe and show that the polynomial entropy of an interval map is given by one-way horseshoes of iterates of the map, obtaining in such a way an analogue of Misiurewicz's theorem on topological…

A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…