Persistent homology for hypergraphs and computational tools — A survey for users
DOI10.1142/S0218216520430075zbMATH Open1460.55008MaRDI QIDQ4965602FDOQ4965602
Authors:
Publication date: 6 March 2021
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Recommendations
- Persistent homology -- a survey
- Persistent homology -- state of the art and challenges
- Persistent homology over directed acyclic graphs
- Persistent homology of vertex-weighted digraphs
- Persistent homology: theory and practice
- Computing persistent homology
- Computing persistent homology
- The Persistent Homology of Cyclic Graphs
- Persistent Homology: A Topological Tool for Higher-Interaction Systems
- Persistent homology computation using combinatorial map simplification
Persistent homology and applications, topological data analysis (55N31) Simplicial sets and complexes in algebraic topology (55U10) Research exposition (monographs, survey articles) pertaining to algebraic topology (55-02) Chain complexes in algebraic topology (55U15)
Cites Work
- Topology and data
- Barcodes: The persistent topology of data
- Stability of persistence diagrams
- Morse theory for cell complexes
- Evolution of the social network of scientific collaborations
- Computing persistent homology
- Topological persistence and simplification
- Discrete Morse theory for free chain complexes
- Minimal resolutions via algebraic discrete Morse theory
- Decomposition of pointwise finite-dimensional persistence modules.
- Morse theory from an algebraic viewpoint
- Proximity of persistence modules and their diagrams
- Title not available (Why is that?)
- A user's guide to discrete Morse theory
- Discrete Morse theory on graphs
- Discrete morse theory and the cohomology ring
- A note on the pure Morse complex of a graph
- The embedded homology of hypergraphs and applications
- Discrete Morse theory for weighted simplicial complexes
Cited In (6)
This page was built for publication: Persistent homology for hypergraphs and computational tools — A survey for users
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965602)