GIULIA MENCONI

Dr. GIULIA MENCONI

orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 June 2008 in International Journal of Modern Physics B
Verified
Journal Article
Closed access
PCPierluigi Contucci
Pierluigi Contucci
IGIgnacio Gallo
Ignacio Gallo
GMGIULIA MENCONI
GIULIA MENCONI

1 February 2003 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
PAP. Allegrini
P. Allegrini
VBVieri Benci
Vieri Benci
PGP. Grigolini
P. Grigolini
PHP. Hamilton
P. Hamilton
MIM. Ignaccolo
M. Ignaccolo
JYJ. Yang
J. Yang

1 March 2002 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
FAFiorella Argenti
Fiorella Argenti
VBVieri Benci
Vieri Benci
PCPaola Cerrai
Paola Cerrai
ACAlessandro Cordelli
Alessandro Cordelli
SGStefano Galatolo
Stefano Galatolo
GMGIULIA MENCONI
GIULIA MENCONI

1 January 2004 in Discrete and Continuous Dynamical Systems-Series B
Verified
Journal Article
Open access
PDF file
VBVieri Benci
Vieri Benci
CBC. Bonanno
C. Bonanno
SGStefano Galatolo
Stefano Galatolo
GMGIULIA MENCONI
GIULIA MENCONI
MVM. Virgilio
M. Virgilio
We present some new results that relate information to chaotic dynamics. In our approach the quantity of information is measured by the Algorithmic Information Content (Kolmogorov complexity) or by a sort of computable version of it (Computable Information Content) in which the information is measured by using a suitable universal data compression algorithm. We apply these notions to the study of dynamical systems by considering the asymptotic behavior of the quantity of information necessary to describe their orbits. When a system is ergodic, this method provides an indicator that equals the Kolmogorov-Sinai entropy almost everywhere. Moreover, if the entropy is null, our method gives new indicators that measure the unpredictability of the system and allows various kind of weak chaos to be classified. Actually, this is the main motivation of this work. The behavior of a 0-entropy dynamical system is far to be completely predictable except that in particular cases. In fact there are 0-entropy systems that exhibit a sort of weak chaos, where the information necessary to describe the orbit behavior increases with time more than logarithmically (periodic case) even if less than linearly (positive entropy case). Also, we believe that the above method is useful to classify 0-entropy time series. To support this point of view, we show some theoretical and experimental results in specific cases.

1 January 2002 in Discrete and Continuous Dynamical Systems-Series B
Verified
Journal Article
Open access
CBC. Bonanno
C. Bonanno
GMGIULIA MENCONI
GIULIA MENCONI
We study the logistic map $f(x)=\lambda x(1-x)$ on the unit square at the chaos threshold. By using the methods of symbolic dynamics, the information content of an orbit of a dynamical system is defined as the Algorithmic Information Content (AIC) of a symbolic sequence. We give results for the behaviour of the AIC for the logistic map. Since the AIC is not a computable function we use, as approximation of the AIC, a notion of information content given by the length of the string after it has been compressed by a compression algorithm, and in particular we introduce a new compression algorithm called CASToRe. The information content is then used to characterise the chaotic behaviour.

18 June 2010 in Journal of Nonlinear Science
Verified
Journal Article
Open access
PDF file
LCLucio Calcagnile
Lucio Calcagnile
SGStefano Galatolo
Stefano Galatolo
GMGIULIA MENCONI
GIULIA MENCONI
We numerically test the method of non-sequential recursive pair substitutions to estimate the entropy of an ergodic source. We compare its performance with other classical methods to estimate the entropy (empirical frequencies, return times, and Lyapunov exponent). We have considered as a benchmark for the methods several systems with different statistical properties: renewal processes, dynamical systems provided and not provided with a Markov partition, and slow or fast decay of correlations. Most experiments are supported by rigorous mathematical results, which are explained in the paper.