Stable Components and Layers

DOI10.4153/S000843951900064XzbMATH Open1448.62096arXiv1905.05788WikidataQ127026092 ScholiaQ127026092MaRDI QIDQ5118445FDOQ5118445

J. F. Jardine

Publication date: 8 September 2020

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Abstract: Component graphs $Gamm{a}_0(F)$ are defined for arrays of sets $F$, and in particular for arrays of path components for Vietoris-Rips complexes and Lesnick complexes. The path components of $Gamm{a}_0(F)$ are the {it stable components} of the array $F$. The stable components for the system of Lesnick complexes $L_{s,k}(X)$ for a finite data set $X$ decompose into layers, which are themselves path components of a graph. Combinatorial scoring functions are defined for layers and stable components.

Full work available at URL: https://arxiv.org/abs/1905.05788

zbMATH Keywords

graphclusterlayerstable componentgalactic structure

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Applications of statistics to physics (62P35) Graph theory (including graph drawing) in computer science (68R10) Persistent homology and applications, topological data analysis (55N31) Galactic and stellar structure (85A15) Topological data analysis (62R40)

Cites Work

• Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
• Characterization, stability and convergence of hierarchical clustering methods

Cited In (1)

• The Structure of Stable Components

This page was built for publication: Stable Components and Layers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118445)