City Research Online

Detecting synchronization clusters in multivariate time series via coarse-graining of Markov chains

Allefeld, C. ORCID: 0000-0002-1037-2735 and Bialonski, S. (2007). Detecting synchronization clusters in multivariate time series via coarse-graining of Markov chains. Physical Review E, 76(6), doi: 10.1103/PhysRevE.76.066207

Abstract

Synchronization cluster analysis is an approach to the detection of underlying structures in data sets of multivariate time series, starting from a matrix R of bivariate synchronization indices. A previous method utilized the eigenvectors of R for cluster identification, analogous to several recent attempts at group identification using eigenvectors of the correlation matrix. All of these approaches assumed a one-to-one correspondence of dominant eigenvectors and clusters, which has however been shown to be wrong in important cases. We clarify the usefulness of eigenvalue decomposition for synchronization cluster analysis by translating the problem into the language of stochastic processes, and derive an enhanced clustering method harnessing recent insights from the coarse-graining of finite-state Markov processes. We illustrate the operation of our method using a simulated system of coupled Lorenz oscillators, and we demonstrate its superior performance over the previous approach. Finally we investigate the question of robustness of the algorithm against small sample size, which is important with regard to field applications.

Publication Type: Article
Additional Information: © 2007 American Physical Society
Publisher Keywords: clustering, synchronization, correlation, eigenvalue decomposition, Markov process
Subjects: Q Science > QA Mathematics
Departments: School of Arts & Social Sciences > Psychology
URI: https://openaccess.city.ac.uk/id/eprint/22838
[img]
Preview
Text - Accepted Version
Download (246kB) | Preview

Export

Downloads

Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login