Preprint Article Version 1 This version is not peer-reviewed

Computing Persistent Homology of Directed Flag Complexes

Version 1 : Received: 27 November 2019 / Approved: 29 November 2019 / Online: 29 November 2019 (03:03:36 CET)

How to cite: Luetgehetmann, D.; Govc, D.; Smith, J.P.; Levi, R. Computing Persistent Homology of Directed Flag Complexes. Preprints 2019, 2019110366 (doi: 10.20944/preprints201911.0366.v1). Luetgehetmann, D.; Govc, D.; Smith, J.P.; Levi, R. Computing Persistent Homology of Directed Flag Complexes. Preprints 2019, 2019110366 (doi: 10.20944/preprints201911.0366.v1).

Abstract

We present a new computing package Flagser, 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 persistent homology computation part of Flagser is based on the program Ripser [2], but is optimised specifically for large computations. The construction of the directed flag complex is done in a way that allows easy parallelisation by arbitrarily many cores. Flagser also has the option of working with undirected graphs. For homology computations Flagser has an Approximate option, which shortens compute time with remarkable accuracy. We demonstrate the power of Flagser by applying it to the construction of the directed flag complex of digital reconstructions of brain microcircuitry by the Blue Brain Project and several other examples. In some instances we perform computation of homology. For a more complete performance analysis, we also apply Flagser to some other data collections. In all cases the hardware used in the computation, the use of memory and the compute time are recorded.

Subject Areas

neural networks; topology; directed graphs; directed flag complexes; persistent homology; computaional software

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.