Statistical Complexity of Sampled Chaotic Attractors

Details Statistical Complexity of Sampled Chaotic Attractors Statistical Complexity of Sampled Chaotic Attractors

2011-05-19

arxiv.org/abs/1105.3927v1

Nonlinear Sciences

Chaotic Dynamics

Submitted for publication to Physica D

Scientific paper

We analyze the statistical complexity vs. entropy plane-representation of sampled chaotic attractors as a function of the sampling period {\tau}. It is shown that if the Bandt and Pompe procedure is used to assign a probability distribution function (PDF) to the pertinent time series, the statistical complexity measure (SCM) attains a definite maximum for a specific sampling period tM. If the usual histogram approach is used instead in order to assign the PDF to the time series, the SCM remains almost constant at any sampling period {\tau}. The significance of tM is further investigated by comparing it with typical times given in the literature for the two main reconstruction processes: the Takens' one in a delay-time embedding, and the exact Nyquist-Shannon reconstruction. It is shown that tM is compatible with those times recommended as adequate delay ones in Takens' reconstruction. The reported results correspond to three representative chaotic systems having correlation dimension 2 < D2 < 3. One recent experiment confirms the analysis presented here.

Affiliated with

Also associated with

No associations

Rating

Statistical Complexity of Sampled Chaotic Attractors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Statistical Complexity of Sampled Chaotic Attractors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Statistical Complexity of Sampled Chaotic Attractors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-69781