An entropy-based persistence barcode ?
We define the notion of minimal barcodes in terms of entropy. Given a simplicial complex, an algorithm for computing a proper filter F is detailed. F preserves the partial ordering imposed by the filtration. F achieves a persistence barcode with small entropy. Examples demonstrating the utility of computing such a proper filter are given.
persistence barcodes entropy simplicial complexes filter filtration persistent homology hasse diagram