Related papers: An Algebraic Introduction to Persistence
The subject of persistent homology has vitalized applications of algebraic topology to point cloud data and to application fields far outside the realm of pure mathematics. The area has seen several fundamentally important results that are…
The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…
The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.
We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric…
In a recent study by Tenner, the concept of the interval poset of a permutation was introduced to effectively represent all intervals and their inclusions within a permutation. In this paper, we present a new geometric viewpoint on interval…
We discuss applications of exact structures and relative homological algebra to the study of invariants of multiparameter persistence modules. This paper is mostly expository, but does contain a pair of novel results. Over finite posets,…
This paper continues the study of the poset of eigenspaces of elements of a unitary reflection group (for a fixed eigenvalue), which was commenced in [6] and [5]. The emphasis in this paper is on the representation theory of unitary…
Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…
In this paper we examine the use of topological methods for multivariate statistics. Using persistent homology from computational algebraic topology, a random sample is used to construct estimators of persistent homology. This estimation…
We introduce the idea of *representation stability* (and several variations) for a sequence of representations V_n of groups G_n. A central application of the new viewpoint we introduce here is the importation of representation theory into…
Many datasets can be viewed as a noisy sampling of an underlying space, and tools from topological data analysis can characterize this structure for the purpose of knowledge discovery. One such tool is persistent homology, which provides a…
The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…
A family of simplicial complexes, connected with simplicial maps and indexed by a poset $P$, is called a poset tower. The concept of poset towers subsumes classical objects of study in the persistence literature, as, for example,…
Topological data analysis is becoming increasingly relevant to support the analysis of unstructured data sets. A common assumption in data analysis is that the data set is a sample---not necessarily a uniform one---of some high-dimensional…
A theory of modules over posets is developed to define computationally feasible, topologically interpretable data structures, in terms of birth and death of homology classes, for persistent homology with multiple real parameters. To replace…
This paper introduces and develops M\"obius homology, a homology theory for representations of finite posets into abelian categories. Although the connection between poset topology and M\"obius functions is classical, we go further by…
We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of…
Echoing recent calls to counter reliability and robustness concerns in machine learning via multiverse analysis, we present PRESTO, a principled framework for mapping the multiverse of machine-learning models that rely on latent…
This paper is a survey of persistent homology, primarily as it is used in topological data analysis. It includes the theory of persistence modules, as well as stability theorems for persistence barcodes, generalized persistence,…