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 by U. Bauer, 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.
1 March 2021 in Journal of Pure and Applied Algebra
Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as “tournaplexes”, whose simplices are tournaments. In particular, given a digraph $${\mathcal {G}}$$ , we associate with it a “flag tournaplex” which is a tournaplex containing the directed flag complex of $${\mathcal {G}}$$ , but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of these ideas by applying them to graph data arising from the Blue Brain Project’s digital reconstruction of a rat’s neocortex.
10 February 2015 in Journal of Homotopy and Related Structures
The covering type of a space X is a numerical homotopy invariant which in some sense measures the homotopical size of X. It was first introduced by Karoubi and Weibel (in Enseign Math 62(3–4):457–474, 2016) as the minimal cardinality of a good cover of a space Y taken among all spaces that are homotopy equivalent to X. We give several estimates of the covering type in terms of other homotopy invariants of X, most notably the ranks of the homology groups of X, the multiplicative structure of the cohomology ring of X and the Lusternik–Schnirelmann category of X. In addition, we relate the covering type of a triangulable space to the number of vertices in its minimal triangulations. In this way we derive within a unified framework several estimates of vertex-minimal triangulations which are either new or extensions of results that have been previously obtained by ad hoc combinatorial arguments.