Clustering coefficient and periodic orbits in flow networks
Related Experiment Video
Updated: Jul 23, 2026

Confocal Imaging of Confined Quiescent and Flowing Colloid-polymer Mixtures
Published on: May 20, 2014
Victor Rodríguez-Méndez1, Enrico Ser-Giacomi2, Emilio Hernández-García1
1IFISC (CSIC-UIB), Instituto de Física Interdisciplinar y Sistemas Complejos, Campus Universitat de les Illes Balears, E-07122 Palma de Mallorca, Spain.
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 3τ, 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.
Related Concept Videos
Poiseuille's Law and Reynolds Number
Bernoulli's Equation for Flow Along a Streamline
Eulerian and Lagrangian Flow Descriptions
The Eulerian method focuses on fixed points in space where fluid properties, such as velocity, pressure, and temperature, are observed as the fluid moves between these...
Plane Potential Flows
Uniform Flow
Uniform flow...
Uniform Depth Channel Flow: Problem Solving
Rapidly Varying Flow

