Persistent homology over directed acyclic graphs (Q1713416): Difference between revisions

A generalization of standard persistent homology, zigzag persistence, and multidimensional persistence to directed acyclic graphs is presented. For this construction, the inclusions of the spaces over which the persistent homology is considered are seen as an acyclic directed graph. An algorithm is presented that computes the persistent homology groups for all subgraphs of a graph with \(n\) vertices which contain a single source and a single sink. The algorithm uses $O(n^4)$ arithmetic operations. For the entire collection see [Zbl 1401.55001].