Before revision: Multiple hypothesis testing requires a control procedure . Simply increasing simulations or permutations to meet a Bonferroni-style threshold is prohibitively expensive.
After revision: In this paper we propose a computationally efficient multiple hypothesis testing procedure for persistence homology. Most current approaches to hypothesis testing using persistence homology is based on resampling or permutation procedures, this is because there exists little distribution theory that provides a natural null model for persistence diagrams . Simply increasing simulations or permutations to meet a Bonferroni-style threshold is prohibitively expensive.