Related papers: Metrics for generalized persistence modules
In the first half this paper, we generalize the theory of layer points for Lesnick- (or degree-Rips-) complexes to the more general context of $\vec{v}$-hierarchical clusterings. Layer points provide a compressed description of a…
In many matching markets--such as athlete recruitment or academic admissions--participants on one side are evaluated by attribute vectors known to the other side, which in turn applies individual \emph{salience vectors} to assign relative…
Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features (2000) as one varies a tuning parameter. Features with short…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
In this work, we define the notion of unimodular random measured metric spaces as a common generalization of various other notions. This includes the discrete cases like unimodular graphs and stationary point processes, as well as the…
While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…
Vietoris-Rips and degree Rips complexes are represented as homotopy types by their underlying posets of simplices, and basic homotopy stability theorems are recast in these terms. These homotopy types are viewed as systems (or functors),…
We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…
Recently, bipath persistent homology has been proposed as an extension of standard persistent homology, along with its visualization (bipath persistence diagram) and computational methods. In the setting of standard persistent homology, the…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
A universal topological marker has been proposed recently to map the topological invariants of Dirac models in any dimension and symmetry class to lattice sites. Using this topological marker, we examine the conditions under which the…
We construct a moduli space of stable pairs over a smooth projective variety, parametrizing morphisms from a fixed coherent sheaf to a varying sheaf of fixed topological type, subject to a stability condition. This generalizes the notion…
In this paper, we study pointwise finite-dimensional (p.f.d.) $2$-parameter persistence modules where each module admits a finite convex isotopy subdivision. We show that a p.f.d. $2$-parameter persistence module $M$ (with a finite convex…
The theory of persistence modules on the commutative ladders $CL_n(\tau)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view…
Persistent homology is a fundamental tool in Topological Data Analysis. The associated algebraic structure is the persistence module, a sequence of vector spaces connected by linear maps. Persistence modules admit a complete and…
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…
We construct the moduli space of finite dimensional representations of generalized quivers for arbitrary connected complex reductive groups using Geometric Invariant Theory as well as Symplectic reduction methods. We explicit characterize…
This paper addresses two questions: (a) can we identify a sensible class of 2-parameter persistence modules on which the rank invariant is complete? (b) can we determine efficiently whether a given 2-parameter persistence module belongs to…
Techniques from computational topology, in particular persistent homology, are becoming increasingly relevant for data analysis. Their stable metrics permit the use of many distance-based data analysis methods, such as multidimensional…
As the size of data increase, persistence diagrams often exhibit structured asymptotic behavior, converging weakly to a Radon measure. However, conventional vector summaries such as persistence landscapes are not well-behaved in this…