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.
A functorial Dowker theorem and persistent homology of asymmetric networks
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Three new proofs of Dowker duality are presented using poset fiber lemmas, along with a generalization showing that homologies of simplicial complexes and relational complexes form a long exact sequence.
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.
-
Short, new proofs of Dowker duality
Three new proofs of Dowker duality are presented using poset fiber lemmas, along with a generalization showing that homologies of simplicial complexes and relational complexes form a long exact sequence.