activity
20112021
most citedStrong laws for recurrence quantification analysis

17 citations · 21 across the 4 of their papers we have counts for

collaborators

6 papers

math.DS2021

Generic chaos on dendrites

Ľubomír Snoha, Vladimír Špitalský, Michal Takács

We characterize dendrites such that a continuous selfmap of is generically chaotic (in the sense of Lasota) if and only if it is generically -chaotic for some…

math.DS2020

Minimal direct products

Matúš Dirbák, Ľubomír Snoha, Vladimír Špitalský

A space is called minimal if it admits a minimal continuous selfmap. We give examples of metrizable continua admitting both minimal homeomorphisms and minimal noninvertible map…

math.DS2018★ 3 cited

Recurrence quantification analysis of the period-doubling sequence

Vladimír Špitalský

The period-doubling sequence is one of the most well-known aperiodic - sequences. In this paper, a complete description of its symbolic recurrence plot is given, and formulas…

math.DS2017

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

Matúš Dirbák, Roman Hric, Peter Maličký +2

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 sp…

math.DS2013★ 17 cited

Strong laws for recurrence quantification analysis

Marian Grendár, Jana Majerová, Vladimír Špitalský

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 a…

cs.IR2011★ 1 cited

Spam filtering by quantitative profiles

M. Grendár, J. Škutová, V. Špitalský

Instead of the 'bag-of-words' representation, in the quantitative profile approach to spam filtering and email categorization, an email is represented by an m-dimensional vector of…