Recursive computation of path homology for stratified digraphs

DOI10.1007/S41468-026-00256-WMaRDI QIDQ7409813zbMATH OpenFDO

Authors Zhengtong Zhu, Zhiyi Chi

Publication date 2026

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S41468-026-00256-W

zbMATH Keywords

digraphneural networkpath homology

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Applied homological algebra and category theory in algebraic topology (55U99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A functorial Dowker theorem and persistent homology of asymmetric networks
• An efficient algorithm for 1-dimensional (Persistent) path homology
• Computing persistent homology
• Computing the Weak Components of a Directed Graph
• Contractible transformations do not change the homology groups of graphs
• Functional summaries of persistence diagrams
• Graph homotopy and Graham homotopy
• Homologies of digraphs and Künneth formulas
• Homology groups of relations
• Hypothesis testing for shapes using vectorized persistence diagrams
• Persistence stability for geometric complexes
• Persistent path homology of directed networks
• Probabilistic machine learning. An introduction
• The Accumulated Persistence Function, a New Useful Functional Summary Statistic for Topological Data Analysis, With a View to Brain Artery Trees and Spatial Point Process Applications
• Topological measurement of deep neural networks using persistent homology
• Topological persistence and simplification

This page was built for publication: Recursive computation of path homology for stratified digraphs

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