Volume 90, Number 1, June 2010
|Number of page(s)||5|
|Published online||29 April 2010|
Permutation complexity of spatiotemporal dynamics
Centro de Investigación Operativa, Universidad Miguel Hernández - 03202 Elche, Spain, EU
2 Departamento de Física, Universidad Rey Juan Carlos - Tulipán s/n 28933 Madrid, Spain, EU
Accepted: 23 March 2010
We call permutation complexity the kind of dynamical complexity captured by any quantity or functional based on order relations, like ordinal patterns and permutation entropies. These mathematical tools have found interesting applications in time series analysis and abstract dynamical systems. In this letter we propose to extend the study of permutation complexity to spatiotemporal systems, by applying some of its tools to a time series obtained by coarse-graining the dynamics and to state vectors at fixed times, considering the latter as sequences. We show that this approach allows to quantify the complexity and to classify different types of dynamics in cellular automata and in coupled map lattices. Furthermore, we show that our analysis can be used to discriminate between different types of spatiotemporal dynamics registered in magnetoencephalograms.
PACS: 05.45.Jn – High-dimensional chaos / 05.45.Tp – Time series analysis / 87.19.le – EEG and MEG
© EPLA, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.