Related papers: Chain recurrence rates and topological entropy
We study chain-recurrence and chain-transitivity in compact dynamical systems without any regularity assumptions on the map. We prove that every compact system has a chain-recurrent point and a closed, invariant, chain-transitive subsystem.…
Following [6,12], we study coupled map networks over arbitrary finite graphs. An estimate from below for a topological entropy of a perturbed coupled map network via a topological entropy of an unperturbed network by making use of the…
A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
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.
We prove that a zero topological entropy continuous tree map always displays zero topological sequence entropy when it is restricted to its non-wandering and chain recurrent sets. In addition, we show that a similar result is not possible…
Recurrence plots exhibit line structures which represent typical behaviour of the investigated system. The local slope of these line structures is connected with a specific transformation of the time scales of different segments of the…
The analysis of temporal networks heavily depends on the analysis of time-respecting paths. However, before being able to model and analyze the time-respecting paths, we have to infer the timescales at which the temporal edges influence…
In this paper we revisit the concept of mobility entropy. Over time, the structure of spatial interactions among urban centres tends to become more complex and evolves from centralised models to more scattered origin and destination…
The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain non-periodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in…
We present a simple method to efficiently compute a lower limit of the topological entropy and its spatial distribution for two-dimensional mappings. These mappings could represent either two-dimensional time-periodic fluid flows or…
Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…
We study dynamics of continuous maps on compact metrizable spaces containing a free interval (i.e., an open subset homeomorphic to an open interval). A special attention is paid to relationships between topological transitivity, weak and…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
In this note we construct measures of maximal entropy for a certain class of maps with critical points called Viana maps. The main ingredients of the proof are the non-uniform expansion features and the slow recurrence (to the critical set)…
Understanding the structural complexity and predictability of complex networks is a central challenge in network science. Although recent studies have revealed a relationship between compression-based entropy and link prediction…
The concept of "$A$-coupled-expanding" map for a transition matrix $A$ has been studied as one of the most important criteria of chaos in the past years. In this paper, the lower bound of the topological entropy for strictly…
Recently, different approaches have been proposed for studying basic properties of time series from a complex network perspective. In this work, the corresponding potentials and limitations of networks based on recurrences in phase space…
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…
We summarize some results of geometric measure theory concerning rectifiable sets and measures. Combined with the entropic chain rule for disintegrations (Vigneaux, 2021), they account for some properties of the entropy of rectifiable…