Identification of individual coherent sets associated with flow trajectories using coherent structure coloring

We present a method for identifying the coherent structures associated with individual Lagrangian flow trajectories even where only sparse particle trajectory data are available. The method, based on techniques in spectral graph theory, uses the Coherent Structure Coloring vector and associated eigenvectors to analyze the distance in higher-dimensional eigenspace between a selected reference trajectory and other tracer trajectories in the flow. By analyzing this distance metric in a hierarchical clustering, the coherent structure of which the reference particle is a member can be identified. This algorithm is proven successful in identifying coherent structures of varying complexities in canonical unsteady flows. Additionally, the method is able to assess the relative coherence of the associated structure in comparison to the surrounding flow. Although the method is demonstrated here in the context of fluid flow kinematics, the generality of the approach allows for its potential application to other unsupervised clustering problems in dynamical systems such as neuronal activity, gene expression, or social networks. In recent years, there has been a proliferation of techniques that aim to characterize fluid flow kinematics on the basis of Lagrangian trajectories of collections of tracer particles. Most of these techniques depend on the presence of tracer particles that are initially closely spaced, in order to compute local gradients of their trajectories. In many applications, the requirement of close tracer spacing cannot be satisfied, especially when the tracers are naturally occurring and their distribution is dictated by the underlying flow. Moreover, current methods often focus on determination of the boundaries of coherent sets, whereas in practice it is often valuable to identify the complete set of trajectories that are coherent with an individual trajectory of interest. We extend the concept of Coherent Structure Coloring, an approach based on spectral graph theory, to achieve identification of the coherent set associated with individual Lagrangian trajectories. The method does not require a priori determination of the number of coherent structures in the flow, nor does it require heuristics regarding the eigenvalue spectrum corresponding to the generalized eigenvalue problem. Importantly, although the method is demonstrated here in the context of fluid flow kinematics, the generality of the approach allows for its potential application to other unsupervised clustering problems in dynamical systems such as neuronal activity, gene expression, or social networks