Discrete homology computations by reduction to zero differentials
We develop a new algorithm for computing (persistent) discrete homology of graphs using reduction to zero differentials and active enumeration. This allows us to compute the fourth homology group of the Greene sphere, along with several previously unknown groups. We also show that persistent discrete homology computes faster than simplicial homology of Vietoris-Rips complex in the high-noise non-metric settings, making it a better choice for noisy data sets.
cs.CG↗