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.
An application of neighbourhoods in digraphs to the classification of binary dynamics
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The homotopy type of the moment-angle complex over the face poset of the complex of injective words is determined by the h-vector of that complex.
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.
-
The homotopy type of the moment-angle complex associated to the complex of injective words
The homotopy type of the moment-angle complex over the face poset of the complex of injective words is determined by the h-vector of that complex.