Homologies of path complexes and digraphs
read the original abstract
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the path homology and cohomology of a digraph.
This paper has not been read by Pith yet.
Forward citations
Cited by 10 Pith papers
-
Bigraded path homology and the magnitude-path spectral sequence
Defines bigraded path homology from the MPSS connecting magnitude and path homology, proves it and all MPSS pages satisfy excision and Kunneth theorems, establishes Mayer-Vietoris for magnitude and bigraded versions, ...
-
Discrete homotopy groups of cubical sets
Discrete homotopy groups of quasisymmetric cubical sets are naturally isomorphic to homotopy groups of geometric realizations, giving combinatorial models for arbitrary cubical sets.
-
Homotopy theories via the magnitude-path spectral sequence
Defines r-quasi-isomorphisms and r-cofibrations on generalized metric spaces so that each page of the magnitude-path spectral sequence satisfies metric Eilenberg-Steenrod axioms and supports Brown category structures ...
-
Mayer Path Homology
Mayer path homology equips path complexes with an N-differential to yield homology groups that distinguish directed graph motifs more finely than standard path homology.
-
Directed Q-Analysis and Directed Higher-Order Connectivity on Digraphs: A Quantitative Approach
A new formalism for directed Q-analysis using directed clique complexes to quantify and compare higher-order connectivities in digraphs.
-
The discrete homotopy hypothesis for directed graphs
Localizing the category of directed graphs at cubical homotopy equivalences produces an ∞-category equivalent to the ∞-category of spaces.
-
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 filtr...
-
Discrete homotopy groups of cubical sets
Extends discrete homotopy groups to cubical sets, proves isomorphism to classical homotopy groups for quasisymmetric cubical sets, and derives combinatorial homotopy description for all cubical sets plus a Hurewicz theorem.
-
Topology Structure Optimization of Reservoirs Using GLMY Homology
Reservoir performance is optimized by modifying minimal representative cycles of one-dimensional GLMY homology groups, with results showing joint influence from network structure and data periodicity.
-
Towards a Quantitative Theory of Digraph-Based Complexes and its Applications in Brain Network Analysis
Developed characterization and similarity measures for digraph-based complexes and applied them to iPDC brain networks to examine higher-order topology changes from pre-ictal to ictal to post-ictal phases in epilepsy.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.