Computing Persistent Homology of Directed Flag Complexes

Computing Persistent Homology of Directed Flag Complexes

We present a new computing package F<span style="font-variant: small-caps;">lagser</span>, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The pe...

Full description

Bibliographic Details
Main Authors: Daniel Lütgehetmann, Dejan Govc, Jason P. Smith, Ran Levi
Format: Article
Language:English
Published: MDPI AG 2020-01-01
Series:Algorithms
Subjects:
neural networks
topology
directed graphs
directed flag complexes
persistent homology
computational software
Online Access:https://www.mdpi.com/1999-4893/13/1/19

Internet

https://www.mdpi.com/1999-4893/13/1/19

Similar Items