Before revision:  We prove that these barcodes are stable under perturbations in the input DMS. In order to formalize the notion of perturbation we introduce a suitable distance between DMSs and we then prove that the value of this distance between any two DMSs admits as a lower bound the bottleneck distance between the Rips barcodes associated to each of two input DMSs. This lower bound can be computed in polynomial time from the DMS inputs.
After revision:  We prove that these barcodes are stable under perturbations in the input DMS. In order to formalize the notion of perturbation we introduce a suitable distance between DMSs and we then prove that the value of this distance between any two DMSs admits as a lower bound for the distance between DGs. Since it relies on barcodes, and their bottleneck distance, this lower bound can be computed in polynomial time from the DMS inputs.