Persistent hyperdigraph homology and persistent hyperdigraph Laplacians

DOI10.3934/FODS.2023010MaRDI QIDQ6154221zbMATH OpenOpenAlexFDO

Authors

Publication date 14 February 2024

Published in Foundations of Data Science (Search for Journal in Brave)

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

zbMATH Keywords

filtrationhomologypersistencetopological hyperdigraphtopological hyperdigraph Laplacians

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph complexes and graph homology (18G85) Persistent homology and applications, topological data analysis (55N31)

Abstract: Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining topological information directly from hyperdigraphs remains a challenge. To address this issue, we introduce hyperdigraph homology in this work. We also propose topological hyperdigraph Laplacians, which can extract both harmonic spectra and non-harmonic spectra from directed and internally organized data. Moreover, we introduce persistent hyperdigraph homology and persistent hyperdigraph Laplacians through filtration, enabling the capture of topological persistence and homotopic shape evolution of directed and structured data across multiple scales. The proposed methods offer new multiscale algebraic topology tools for topological data analysis.

Recommendations

• A directed persistent homology theory for dissimilarity functions
• The magnitude homology of a hypergraph
• Persistent Mayer homology and persistent Mayer Laplacian

Cites work

• A category-theoretical approach to hypergraphs
• A persistence landscapes toolbox for topological statistics
• Aspects of topological approaches for data science
• Computational homology
• Computing persistent homology
• Directed hypergraphs and applications
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Discrete Poincaré lemma
• Engineering a direct \(k\)-way hypergraph partitioning algorithm
• Evolutionary de Rham-Hodge method
• Finite element exterior calculus, homological techniques, and applications
• HERMES: persistent spectral graph software
• Homologies of digraphs and Künneth formulas
• scientific article; zbMATH DE number 1931696 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Linear connectivity problems in directed hypergraphs
• Path complexes and their homologies
• Path homology of directed hypergraphs
• Persistent Cohomology for Data With Multicomponent Heterogeneous Information
• Persistent homology -- a survey
• Persistent Laplacians: properties, algorithms and implications
• Persistent path Laplacian
• Spectra of combinatorial Laplace operators on simplicial complexes
• The embedded homology of hypergraphs and applications
• Topology and data
• Toward a spectral theory of cellular sheaves

Cited in

(7)

• Persistent Dirac of paths on digraphs and hypergraphs
• ChatGPT for computational topology
• Persistent Mayer homology and persistent Mayer Laplacian
• The magnitude homology of a hypergraph
• Persistent directed flag Laplacian
• Double complexes for configuration spaces and hypergraphs on manifolds
• Persistent interaction topology in data analysis

This page was built for publication: Persistent hyperdigraph homology and persistent hyperdigraph Laplacians

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