Computing Persistent Homology of Flag Complexes via Strong Collapses - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Computing Persistent Homology of Flag Complexes via Strong Collapses


In this article, we focus on the problem of computing Persistent Homology of a flag tower, i.e. a sequence of flag complexes connected by simplicial maps. We show that if we restrict the class of simplicial complexes to flag complexes, we can achieve decisive improvement in terms of time and space complexities with respect to previous work. We show that strong collapses of flag complexes can be computed in time O(k^2 v^2) where v is the number of vertices of the complex and k is the maximal degree of its graph. Moreover we can strong collapse a flag complex knowing only its 1-skeleton and the resulting complex is also a flag complex. When we strong collapse the complexes in a flag tower, we obtain a reduced sequence that is also a flag tower we call the core flag tower. We then convert the core flag tower to an equivalent filtration to compute its PH. Here again, we only use the 1-skeletons of the complexes. The resulting method is simple and extremely efficient.
Fichier principal
Vignette du fichier
PersistenceOfFlagComplexes.pdf (519.89 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02078311 , version 1 (25-03-2019)



Jean-Daniel Boissonnat, Siddharth Pritam. Computing Persistent Homology of Flag Complexes via Strong Collapses. SoCG 2019 - International Symposium on Computational geometry, Apr 2019, Portland, United States. ⟨10.4230/LIPIcs.SoCG.2019.55⟩. ⟨hal-02078311⟩
139 View
573 Download



Gmail Mastodon Facebook X LinkedIn More