Searcharxiv⌕ Search

arXiv subjects

Vladimír Špitalský

Publications and source records attributed to Vladimír Špitalský.

15 recordsLinked to original sources

Recurrence analysis of uniform binary substitutions

Recurrence rate, determinism, average line length, and entropy of line lengths are measures of complexity in recurrence quantification analysis, that help to understand the structure, predictability and complexity of dynamical systems. In this paper, we provide explicit formulas for these characteristics for all binary substitutions of constant length. Moreover, we show that the determinism of such substitutions converges to one, which shows that these systems are highly predictable.

math.DS↗

Local correlation entropy

Local correlation entropy, introduced by Takens in 1983, represents the exponential decay rate of the relative frequency of recurrences in the trajectory of a point, as the embedding dimension grows to infinity. In this paper we study relationship between the supremum of local correlation entropies and the topological entropy. For dynamical systems on graphs we prove that the two quantities coincide. Moreover, there is an uncountable set of points with local correlation entropy arbitrarily close to the topological entropy. On the other hand, we construct a strictly ergodic subshift with positive topological entropy having all local correlation entropies equal to zero. As a necessary tool, we derive an expected relationship between the local correlation entropies of a system and those of its iterates.

math.DS↗

Generic chaos on dendrites

We characterize dendrites $D$ such that a continuous selfmap of $D$ is generically chaotic (in the sense of Lasota) if and only if it is generically $\varepsilon$-chaotic for some $\varepsilon>0$. In other words, we characterize dendrites on which generic chaos of a continuous map can be described in terms of the behaviour of subdendrites with nonempty interiors under iterates of the map. A dendrite $D$ belongs to this class if and only if it is completely regular, with all points of finite order (that is, if and only if $D$ contains neither a copy of the Riemann dendrite nor a copy of the $ω$-star).

math.DS↗

Minimal space with non-minimal square

We completely solve the problem whether the product of two compact metric spaces admitting minimal maps also admits a minimal map. Recently Boroński, Clark and Oprocha gave a negative answer in the particular case when homeomorphisms rather than continuous maps are considered. In the present paper we show that there is a metric continuum $X$ admitting a minimal map, in fact a minimal homeomorphism, such that $X\times X$ does not admit any minimal map.

math.DS↗

Minimal direct products

A space is called minimal if it admits a minimal continuous selfmap. We give examples of metrizable continua $X$ admitting both minimal homeomorphisms and minimal noninvertible maps, whose squares $X\times X$ are not minimal, i.e., they admit neither minimal homeomorphisms nor minimal noninvertible maps, thus providing a definitive answer to a question posed by Bruin, Kolyada and the second author in 2003. (In 2018, Boroński, Clark and Oprocha provided an answer in the case when only homeomorphisms were considered.) Then we introduce and study the notion of product-minimality. We call a compact metrizable space $Y$ product-minimal if, for every minimal system $(X,T)$ given by a metrizable space $X$ and a continuous selfmap $T$, there is a continuous map $S\colon Y\to Y$ such that the product $(X\times Y,T\times S)$ is minimal. If such a map $S$ always exists in the class of homeomorphisms, we say that $Y$ is a homeo-product-minimal space. We show that many classical examples of minimal spaces, including compact connected metrizable abelian groups, compact connected manifolds without boundary admitting a free action of a nontrivial compact connected Lie group, and many others, are in fact homeo-product-minimal.

math.DS↗

Minimality for actions of abelian semigroups on compact spaces with a free interval

We study minimality for continuous actions of abelian semigroups on compact Hausdorff spaces with a free interval. First, we give a necessary and sufficient condition for such a space to admit a minimal action of a given abelian semigroup. Further, for actions of abelian semigroups we provide a trichotomy for the topological structure of minimal sets intersecting a free interval.

math.DS↗

Recurrence determinism and Li-Yorke chaos for interval maps

Recurrence determinism, one of the fundamental characteristics of recurrence quantification analysis, measures predictability of a trajectory of a dynamical system. It is tightly connected with the conditional probability that, given a recurrence, following states of the trajectory will be recurrences. In this paper we study recurrence determinism of interval dynamical systems. We show that recurrence determinism distinguishes three main types of $ω$-limit sets of zero entropy maps: finite, solenoidal without non-separable points, and solenoidal with non-separable points. As a corollary we obtain characterizations of strongly non-chaotic and Li-Yorke (non-)chaotic interval maps via recurrence determinism. For strongly non-chaotic maps, recurrence determinism is always equal to one. Li-Yorke non-chaotic interval maps are those for which recurrence determinism is always positive. Finally, Li-Yorke chaos implies the existence of a Cantor set of points with zero determinism.

math.DS↗

Multinomial and empirical likelihood under convex constraints: directions of recession, Fenchel duality, perturbations

The primal problem of multinomial likelihood maximization restricted to a convex closed subset of the probability simplex is studied. Contrary to widely held belief, a solution of this problem may assign a positive mass to an outcome with zero count. Related flaws in the simplified Lagrange and Fenchel dual problems, which arise because the recession directions are ignored, are identified and corrected. A solution of the primal problem can be obtained by the PP (perturbed primal) algorithm, that is, as the limit of a sequence of solutions of perturbed primal problems. The PP algorithm may be implemented by the simplified Fenchel dual. The results permit us to specify linear sets and data such that the empirical likelihood-maximizing distribution exists and is the same as the multinomial likelihood-maximizing distribution. The multinomial likelihood ratio reaches, in general, a different conclusion than the empirical likelihood ratio. Implications for minimum discrimination information, compositional data analysis, Lindsay geometry, bootstrap with auxiliary information, and Lagrange multiplier tests are discussed.

math.ST↗

Transitive dendrite map with infinite decomposition ideal

By a result of Blokh from 1984, every transitive map of a tree has the relative specification property, and so it has finite decomposition ideal, positive entropy and dense periodic points. In this paper we construct a transitive dendrite map with infinite decomposition ideal and a unique periodic point. Basically, the constructed map is (with respect to any non-atomic invariant measure) a measure-theoretic extension of the dyadic adding machine. Together with an example of Hoehn and Mouron from 2013, this shows that transitivity on dendrites is much more varied than that on trees.

math.DS↗

Strong laws for recurrence quantification analysis

The recurrence rate and determinism are two of the basic complexity measures studied in the recurrence quantification analysis. In this paper, the recurrence rate and determinism are expressed in terms of the correlation sums, and strong laws of large numbers are given for them.

math.DS↗

Topological entropy of transitive dendrite maps

We show that every dendrite satisfying the condition that no subtree of it contains all free arcs admits a transitive, even exactly Devaney chaotic map with arbitrarily small entropy. This gives a partial answer to a question of Baldwin from 2001.

math.DS↗

Entropy and exact Devaney chaos on totally regular continua

We study topological entropy of exactly Devaney chaotic maps on totally regular continua, i.e. on (topologically) rectifiable curves. After introducing the so-called P-Lipschitz maps (where P is a finite invariant set) we give an upper bound for their topological entropy. We prove that if a non-degenerate totally regular continuum X contains a free arc which does not disconnect X or if X contains arbitrarily large generalized stars then X admits an exactly Devaney chaotic map with arbitrarily small entropy. A possible application for further study of the best lower bounds of topological entropies of transitive/Devaney chaotic maps is indicated.

math.DS↗

Length-expanding Lipschitz maps on totally regular continua

The tent map is an elementary example of an interval map possessing many interesting properties, such as dense periodicity, exactness, Lipschitzness and a kind of length-expansiveness. It is often used in constructions of dynamical systems on the interval/trees/graphs. The purpose of the present paper is to construct, on totally regular continua (i.e. on topologically rectifiable curves), maps sharing some typical properties with the tent map. These maps will be called length-expanding Lipschitz maps, briefly LEL maps. We show that every totally regular continuum endowed with a suitable metric admits a LEL map. As an application we obtain that every totally regular continuum admits an exactly Devaney chaotic map with finite entropy and the specification property.

math.DS↗

Dynamical consequences of a free interval: minimality, transitivity, mixing and topological entropy

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 strong topological mixing, dense periodicity and topological entropy as well as to the topological structure of minimal sets. In particular, a trichotomy for minimal sets and a dichotomy for transitive maps are proved.

math.DS↗