SearcharxivSearch

arXiv · 2607.21476

Persistent Entropy Transform: An entropy-based descriptor for topological data analysis

Abstract

Persistent entropy provides a compact summary of persistence diagrams, but discards geometric information inherent to the data. This limitation creates a gap between scalar summaries, which are computationally efficient but geometrically coarse, and directional topological transforms, which are expressive but high-dimensional and computationally demanding. In this work, we introduce the Persistent Entropy Transform (PET), a novel directional topological descriptor which can be interpreted as an entropy-based compression of directional topological transforms. We establish basic theoretical properties of PET. In particular, we prove translation invariance, scale invariance under positive uniform scalings, and orthogonal equivariance. Empirically, we use synthetic shapes to assess directional sensitivity, consistency with rotational equivariance, robustness under controlled perturbations, and dependence on directional sampling density. In addition, we test the novel tool on two real time-series benchmark datasets, the TwoLead- ECG and the MIT-BIH, to provide a proof of concept showing that PET embeddings can be used succesfully as compact feature vectors on real time-series benchmarks. These experiments support and validate PET as a compact and computationally tractable descriptor.

Explore related subjects

Keep this discovery

BibTeXRIS

Victor Toscano-Duran, Miguel A. Gutiérrez Naranjo, Rocio Gonzalez-Diaz. 2026-07-23. Persistent Entropy Transform: An entropy-based descriptor for topological data analysis. https://arxiv.org/abs/2607.21476

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN