Expected Complexity of Persistent Homology Computation via Matrix Reduction

The author analyzes the expected complexity of computing persistent homology using matrix reduction, showing that the reduced matrix is sparser than worst-case predictions. The study links Betti numbers to the fill-in of the boundary matrix.