Network measures of mixing

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Standard

Network measures of mixing. / Banisch, Ralf; Koltai, Péter; Padberg-Gehle, Kathrin.
in: Chaos, Jahrgang 29, Nr. 6, 063125, 06.2019.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Harvard

Banisch, R, Koltai, P & Padberg-Gehle, K 2019, 'Network measures of mixing', Chaos, Jg. 29, Nr. 6, 063125. https://doi.org/10.1063/1.5087632

APA

Banisch, R., Koltai, P., & Padberg-Gehle, K. (2019). Network measures of mixing. Chaos, 29(6), Artikel 063125. https://doi.org/10.1063/1.5087632

Vancouver

Banisch R, Koltai P, Padberg-Gehle K. Network measures of mixing. Chaos. 2019 Jun;29(6):063125. doi: 10.1063/1.5087632

Bibtex

@article{708eeeb6be8543f6a41eb41bd44536fd,
title = "Network measures of mixing",
abstract = "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.",
keywords = "Mathematics",
author = "Ralf Banisch and P{\'e}ter Koltai and Kathrin Padberg-Gehle",
year = "2019",
month = jun,
doi = "10.1063/1.5087632",
language = "English",
volume = "29",
journal = "Chaos",
issn = "1054-1500",
publisher = "American Institute of Physics Inc.",
number = "6",

}

RIS

TY - JOUR

T1 - Network measures of mixing

AU - Banisch, Ralf

AU - Koltai, Péter

AU - Padberg-Gehle, Kathrin

PY - 2019/6

Y1 - 2019/6

N2 - 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.

AB - 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.

KW - Mathematics

UR - http://www.scopus.com/inward/record.url?scp=85068133690&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/18116c63-1398-3650-8ab6-89a40db186a5/

U2 - 10.1063/1.5087632

DO - 10.1063/1.5087632

M3 - Journal articles

C2 - 31266326

AN - SCOPUS:85068133690

VL - 29

JO - Chaos

JF - Chaos

SN - 1054-1500

IS - 6

M1 - 063125

ER -

Links

DOI