Vines and vineyard connecting a stack of persistence diagrams have been
...
1-parameter persistent homology, a cornerstone in Topological Data Analy...
We first introduce the notion of meta-rank for a 2-parameter persistence...
Connection matrices are a generalization of Morse boundary operators fro...
It is well known that ordinary persistence on graphs can be computed mor...
It is well-known that cohomology has a richer structure than homology.
H...
Zigzag persistence is a powerful extension of the standard persistence w...
Multivector fields and combinatorial dynamical systems have recently bec...
Computing persistence over changing filtrations give rise to a stack of ...
The notion of generalized rank invariant in the context of multiparamete...
Persistence diagrams (PD)s play a central role in topological data analy...
Duality results connecting persistence modules for absolute and relative...
One of the main reasons for topological persistence being useful in data...
Multivector fields provide an avenue for studying continuous dynamical
s...
In standard persistent homology, a persistent cycle born and dying with ...
Tomography is a widely used tool for analyzing microstructures in three
...
Curve reconstruction from unstructured points in a plane is a fundamenta...
Graphs model real-world circumstances in many applications where they ma...
A combinatorial framework for dynamical systems provides an avenue for
c...
This paper focuses on developing an efficient algorithm for analyzing a
...
Automatic Extraction of road network from satellite images is a goal tha...
Persistent cycles, especially the minimal ones, are useful geometric fea...
The classical persistence algorithm virtually computes the unique
decomp...
Persistence diagrams, which summarize the birth and death of homological...
Persistent homology is a popular data analysis technique that is used to...
Recently it has been shown that computing the dimension of the first hom...
Recovering hidden graph-like structures from potentially noisy data is a...
Computation of the interleaving distance between persistence modules is ...
Efficient computation of shortest cycles which form a homology basis und...
We investigate combinatorial dynamical systems on simplicial complexes
c...
We study hierarchical clusterings of metric spaces that change over time...