Clustering coefficient and periodic orbits in flow networks
Abstract
We show that the clustering coefficient, a standard measure in network theory, when applied to flow networks, i.e. graph representations of fluid flows in which links between nodes represent fluid transport between spatial regions, identifies approximate locations of periodic trajectories in the flow system. This is true for steady flows and for periodic ones in which the time interval used to construct the network is the period of the flow or a multiple of it. In other situations the clustering coefficient still identifies cyclic motion between regions of the fluid. Besides the fluid context, these ideas apply equally well to general dynamical systems. By varying the value of used to construct the network, a kind of spectroscopy can be performed so that the observation of high values of mean clustering at a value of reveals the presence of periodic orbits of period which impact phase space significantly. These results are illustrated with examples of increasing complexity, namely a steady and a periodically perturbed model two-dimensional fluid flow, the three-dimensional Lorenz system, and the turbulent surface flow obtained from a numerical model of circulation in the Mediterranean sea.
Keywords
Cite
@article{arxiv.1609.03291,
title = {Clustering coefficient and periodic orbits in flow networks},
author = {Victor Rodriguez-Mendez and Enrico Ser-Giacomi and Emilio Hernandez-Garcia},
journal= {arXiv preprint arXiv:1609.03291},
year = {2017}
}
Comments
11 pages, 11 figures. To appear in Chaos, April 2017