An Information Theory of Persistent Homology: Entropy, the Data Processing Inequality, and Rate–Distortion Bounds for Topological Features
Mathematics · 20.04.2026 · 14 (8) · 1385
DOI: 10.3390/math14081385 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 20.04.2026. Verfasst von Deepalakshmi Perumalsamy und 2 weiteren Autor:innen. Die Arbeit nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Background
Topological Data Analysis (TDA) captures multi-scale geometric features of data as persistence diagrams, yet no principled information-theoretic framework quantifies how much information those features carry, how efficiently they compress, or when they are informationally irreducible.
Methods
We construct a measure-theoretic probability space over persistence diagram space using a Poisson-process reference measure, and define topological entropy (H-T), topological mutual information (I-T), and a topological rate–distortion function as the core objects of a new theory.
Results
Four theorems with full proofs establish finite stability, axiomatic uniqueness, a Topological Data Processing Inequality, and a Rate–Distortion Theorem with explicit Poisson-model closed-form formula. A Renyi generalization of topological entropy is also established. Computational and practical implementation aspects—including finite-sample estimation, multi-parameter extension, and algorithmic realization—are addressed inline throughout the paper.
Conclusions
This framework provides a rigorous measure-theoretic information-theoretic foundation for persistent homology, demonstrated on simulated brain connectivity and point cloud data, with applications to threshold selection, genomic classification bounds, and compressed sensing.
Zitieren
APA
Perumalsamy, D., Gunalan, C., & Thinakaran, R. (2026). An Information Theory of Persistent Homology: Entropy, the Data Processing Inequality, and Rate–Distortion Bounds for Topological Features. Mathematics, 14(8), 1385. https://doi.org/10.3390/math14081385
Vancouver
Perumalsamy D, Gunalan C, Thinakaran R. An Information Theory of Persistent Homology: Entropy, the Data Processing Inequality, and Rate–Distortion Bounds for Topological Features. Mathematics. 2026;14(8):1385. doi:10.3390/math14081385
BibTeX
@article{Perumalsamy2026,
author = {Perumalsamy, Deepalakshmi and Gunalan, Caleb and Thinakaran, Rajermani},
title = {An Information Theory of Persistent Homology: Entropy, the Data Processing Inequality, and Rate–Distortion Bounds for Topological Features},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {8},
pages = {1385},
doi = {10.3390/math14081385}
}
EUVIMED