Network measures of mixing
Research output: Journal contributions › Journal articles › Research › peer-review
Authors
Transport and mixing processes in fluid flows can be studied directly from Lagrangian trajectory data, such as those 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.
Original language | English |
---|---|
Article number | 063125 |
Journal | Chaos |
Volume | 29 |
Issue number | 6 |
ISSN | 1054-1500 |
DOIs | |
Publication status | Published - 06.2019 |
Bibliographical note
This work is supported by the Deutsche Forschungsgemeinschaft (DFG) through the Priority Programme SPP 1881 “Turbulent Superstructures.” P.K. also acknowledges funding from the Deutsche Forschungsgemeinschaft (DFG) through the Collaborative Research Center 1114 “Scaling Cascades of Complex Systems,” Project A01. K.P.G. also acknowledges funding from EU Marie-Skłodowska-Curie ITN Critical Transitions in Complex Systems (H2020-MSCA-2014-ITN 643073 CRITICS).
- Mathematics