activity
20012005
most citedDynamical systems and computable information

2 citations · 3 across the 6 of their papers we have counts for

collaborators

7 papers

math.DS2005

Hitting time and dimension in Axiom A systems and generic interval excanges

Stefano Galatolo

In this note we prove that for equilibrium states of axiom A systems the time needed for a typical point to enter for the first time in a typical ball with radiu…

nlin.CD2004

Multifractals via recurrence times ?

J. -R. Chazottes, S. Galatolo

This letter is a comment on an article by T.C. Halsey and M.H. Jensen in Nature about using recurrence times as a reliable tool to estimate multifractal dimensions of strange attra…

math.DS2004

Algorithmic information for intermittent systems with an indifferent fixed point

Claudio Bonanno, Stefano Galatolo

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…

math.DS2003

Dimension via Waiting time and Recurrence

S. Galatolo

Quantitative recurrence indicators are defined by measuring the first entrance time of the orbit of a point in a decreasing sequence of neighborhoods of another point . It i…

cond-mat.stat-mech20022 cited

Dynamical systems and computable information

V. Benci, C. Bonanno, S. Galatolo +2

We present some new results which relate information to chaotic dynamics. In our approach the quantity of information is measured by the Algorithmic Information Content (Kolmogorov…

math.DS20021 cited

Global and local Complexity in weakly chaotic dynamical systems

Stefano Galatolo

In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. Th…