Defines the walk-length filtration for persistent homology on directed graphs, establishes stability under a generalized L1-style network distance, supplies a computation algorithm, and compares it to the Dowker filtration on cycle and synthetic hippocampal networks.
Persistent path homology of directed networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Walk-Length Filtration for Persistent Homology on Weighted Directed Graphs
Defines the walk-length filtration for persistent homology on directed graphs, establishes stability under a generalized L1-style network distance, supplies a computation algorithm, and compares it to the Dowker filtration on cycle and synthetic hippocampal networks.