Volume 108, Number 6, December 2014
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||12 January 2015|
Cycle-flow–based module detection in directed recurrence networks
1 Institut für Mathematik und Informatik, Freie Universität Berlin - 14195 Berlin, Germany
2 Zuse Institute Berlin - 14195 Berlin, Germany
Received: 31 July 2014
Accepted: 9 December 2014
We present a new cycle-flow–based method for finding fuzzy partitions of weighted directed networks coming from time series data. We show that this method overcomes essential problems of most existing clustering approaches, which tend to ignore important directional information by considering only one-step, one-directional node connections. Our method introduces a novel measure of communication between nodes using multi-step, bidirectional transitions encoded by a cycle decomposition of the probability flow. Symmetric properties of this measure enable us to construct an undirected graph that captures the information flow of the original graph seen by the data and apply clustering methods designed for undirected graphs. Finally, we demonstrate our algorithm by analyzing earthquake time series data, which naturally induce (time-)directed networks.
PACS: 89.75.Hc – Networks and genealogical trees / 02.50.Ga – Markov processes / 05.45.Tp – Time series analysis
© EPLA, 2014
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.