Homologies of path complexes and digraphs
arXiv:1207.2834
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.
88 pages, 37 figures
Cited by in corpus (25)
- Path homologies of deep feedforward networks
- Graph Laplacians, Riemannian Manifolds and their Machine-Learning
- Torsion of digraphs and path complexes
- Hodge Decompositions for Weighted Hypergraphs
- Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes
- The Kuenneth formula for graphs
- Relationships between cycle spaces, gain graphs, graph coverings, fundamental groups, path homology, and graph curvature
- First Betti number of the path homology of random directed graphs
- Weighted Path homology of Weighted Digraphs and Persistence
- Path homology and temporal networks
- Path homology as a stronger analogue of cyclomatic complexity
- Weighted Analytic Torsion for Weighted Digraphs
- Persistent Path Homology of Directed Networks
- A directed persistent homology theory for dissimilarity functions
- Discrete Morse Theory on Digraphs
- Weighted Simplicial Complexes and Weighted Analytic Torsions
- A Discrete Morse Theory for Digraphs
- A Unified Topological Approach to Data Science
- Discrete Differential Calculus on Simplicial Complexes and Constrained Homology
- A Künneth Formula of Hypergraphs
- Simplicial-like Identities for The Paths and The Regular Paths on Discrete Sets
- Path Cohomology of Locally Finite Digraphs,Hodge's Theorem and the -Lazy Random Walk
- The geometric realization of regular path complexes via (co-)homology
- Witten-Morse functions and Morse inequalities on digraphs
- Differential algebras on digraphs and parametrized homology