The persistent homology of cyclic graphs

Henry Adams, Ethan Coldren, Sean Willmot

We give an $O(n^2(k+\log n))$ algorithm for computing the $k$-dimensional persistent homology of a filtration of clique complexes of cyclic graphs on $n$ vertices. This is nearly q…