Network Measures of Mixing

Abstract

Transport and mixing processes in fluid flows can be studied directly from Lagrangian trajectory data, such as obtained from particle tracking experiments. Recent work in this context highlights the application of graph-based approaches, where trajectories serve as nodes and some similarity or distance measure between them is employed to build a (possibly weighted) network, which is then analyzed using spectral methods. Here, we consider the simplest case of an unweighted, undirected network and analytically relate local network measures such as node degree or clustering coefficient to flow structures. In particular, we use these local measures to divide the family of trajectories into groups of similar dynamical behavior via manifold learning methods.

References in corpus (6)

• Ambiguities in recurrence-based complex network representations of time series
• Flow networks: A characterization of geophysical fluid transport
• Geometry of the ergodic quotient reveals coherent structures in flows
• Coherent structure coloring: identification of coherent structures from sparse data using graph theory
• Clustering coefficient and periodic orbits in flow networks
• Level set formulation of two-dimensional Lagrangian vortex detection methods