A survey organizing recent TDA and TDL methods beyond persistent homology and connecting them to data structures and vectorization.
Primitive path homology
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper we introduce a primitive path homology theory on the category of simple digraphs. On the subcategory of asymmetric digraphs, this theory coincides with the path homology theory which was introduced by Grigor'yan, Lin, Muranov, and Yau, but these theories are different in general case. We study properties of the primitive path homology and describe relations between the primitive path homology and the path homology. Let $a,b$ two different vertices of a digraph. Our approach gives a possibility to construct primitive homology theories of paths which have a given tail vertex $a$ or (and) a given head vertex $b$. We study these theories and describe also relationships between them and the path homology theory.
citation-role summary
citation-polarity summary
fields
math.HO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Topological Data Analysis and Topological Deep Learning Beyond Persistent Homology -- A Review
A survey organizing recent TDA and TDL methods beyond persistent homology and connecting them to data structures and vectorization.