Network measures of mixing
From MaRDI portal
Publication:5227594
DOI10.1063/1.5087632zbMATH Open1416.37006arXiv1901.00799OpenAlexW3100658280WikidataQ91559841 ScholiaQ91559841MaRDI QIDQ5227594FDOQ5227594
Authors: Ralf Banisch, Péter Koltai, Kathrin Padberg-Gehle 
Publication date: 6 August 2019
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1901.00799
Recommendations
Cites Work
- Diffusion maps
- Least squares quantization in PCM
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Almost-invariant sets and invariant manifolds - connecting probabilistic and geometric descriptions of coherent structures in flows
- Definition and properties of Lagrangian coherent structures from finite-time Lyapunov exponents in two-dimensional aperiodic flows
- Lagrangian descriptors: a method for revealing phase space structures of general time dependent dynamical systems
- Geometry of the ergodic quotient reveals coherent structures in flows
- Ergodic theory and visualization. I. mesochronic plots for visualization of ergodic partition and invariant sets
- Almost-Invariant and Finite-Time Coherent Sets: Directionality, Duration, and Diffusion
- Identifying finite-time coherent sets from limited quantities of Lagrangian data
- Recurrence networks -- a novel paradigm for nonlinear time series analysis
- TRANSPORT IN DYNAMICAL ASTRONOMY AND MULTIBODY PROBLEMS
- Dynamic isoperimetry and the geometry of Lagrangian coherent structures
- Title not available (Why is that?)
- Understanding the geometry of transport: diffusion maps for Lagrangian trajectory data unravel coherent sets
- Local expansion concepts for detecting transport barriers in dynamical systems
- Characterizing flows by complex network methods
- Correlation dimension and phase space contraction via extreme value theory
- A rough-and-ready cluster-based approach for extracting finite-time coherent sets from sparse and incomplete trajectory data
- A critical comparison of Lagrangian methods for coherent structure detection
- From large deviations to semidistances of transport and mixing: coherence analysis for finite Lagrangian data
- Robust FEM-based extraction of finite-time coherent sets using scattered, sparse, and incomplete trajectories
- Coherent structure colouring: identification of coherent structures from sparse data using graph theory
Cited In (7)
- Complex networks unveiling spatial patterns in turbulence
- Coherent set identification via direct low rank maximum likelihood estimation
- A perturbation-theoretic approach to Lagrangian flow networks
- Characterizing flows by complex network methods
- Transport and scale interactions in geophysical flows. Abstracts from the workshop held July 16--21, 2023
- Lagrangian studies of coherent sets and heat transport in constant heat flux-driven turbulent Rayleigh-Bénard convection
- Lagrangian network analysis of turbulent mixing
This page was built for publication: Network measures of mixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227594)
