Sampling period, statistical complexity, and chaotic attractors

► The statistical complexity measure of sampled chaotic attractors is studied. ► Using the Bandt and Pompe procedure it has a definite maximum at a sampling period tM. ► It is shown that tM is an adequate delay in Takens reconstruction. ► It is shown that tM is compatible with Nyquist sampling theorem. ► One recent experiment confirms the analysis presented here.