Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHERMES: Persistent spectral graph software
113
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Persistent homology (PH) is one of the most popular tools in topological data analysis (TDA), while graph theory has had a significant impact on data science. Our earlier work introduced the persistent spectral graph (PSG) theory as a unified multiscale paradigm to encompass TDA and geometric analysis. In PSG theory, families of persistent Laplacians (PLs) corresponding to various topological dimensions are constructed via a filtration to sample a given dataset at multiple scales. The harmonic spectra from the null spaces of PLs offer the same topological invariants, namely persistent Betti numbers, at various dimensions as those provided by PH, while the non-harmonic spectra of PLs give rise to additional geometric analysis of the shape of the data. In this work, we develop an open-source software package, called highly efficient robust multidimensional evolutionary spectra (HERMES), to enable broad applications of PSGs in science, engineering, and technology. To ensure the reliability and robustness of HERMES, we have validated the software with simple geometric shapes and complex datasets from three-dimensional (3D) protein structures. We found that the smallest non-zero eigenvalues are very sensitive to data abnormality.
rate research
Read More
In this paper we introduce the persistent magnitude, a new numerical invariant of (sufficiently nice) graded persistence modules. It is a weighted and signed count of the bars of the persistence module, in which a bar of the form $[a,b)$ in degree $d$ is counted with weight $(e^{-a}-e^{-b})$ and sign $(-1)^d$. Persistent magnitude has good formal properties, such as additivity with respect to exact sequences and compatibility with tensor products, and has interpretations in terms of both the associated graded functor, and the Laplace transform. Our definition is inspired by Otters notion of blurred magnitude homology: we show that the magnitude of a finite metric space is precisely the persistent magnitude of its blurred magnitude homology. Turning this result on its head, we obtain a strategy for turning existing persistent homology theories into new numerical invariants by applying the persistent magnitude. We explore this strategy in detail in the case of persistent homology of Morse functions, and in the case of Rips homology.
We introduce weight
Cohomological ideas have recently been injected into persistent homology and have been utilized for both enriching and accelerating the calculation of persistence diagrams. For instance, the software Ripser fundamentally exploits the computational advantages offered by cohomological ideas. The cup product operation which is available at cohomology level gives rise to a graded ring structure which extends the natural vector space structure and is therefore able to extract and encode additional rich information. The maximum number of cocycles having non-zero cup product yields an invariant, the Cup-Length, which is efficient at discriminating spaces. In this paper, we lift the cup-length into the Persistent Cup-Length invariant for the purpose of extracting non-trivial information about the evolution of the cohomology ring structure across a filtration. We show that the Persistent Cup-Length can be computed from a family of representative cocycles and devise a polynomial time algorithm for the computation of the Persistent Cup-Length invariant. We furthermore show that this invariant is stable under suitable interleaving-type distances. Along the way, we identify an invariant which we call the Cup-Length Diagram, which is stronger than persistent cup-length but can still be computed efficiently. In addition, by considering the $ell$-fold product of persistent cohomology rings, we identify certain persistence modules, which are also stable and can be used to evaluate the persistent cup-length.
Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove that multidimensional rank invariants are stable with respect to function perturbations. More precisely, we construct a distance between rank invariants such that small changes of the function imply only small changes of the rank invariant. This result can be obtained by assuming the function to be just continuous. Multidimensional stability opens the way to a stable shape comparison methodology based on multidimensional persistence.
We derive the relationship between the persistent homology barcodes of two dual filtered CW complexes. Applied to greyscale digital images, we obtain an algorithm to convert barcodes between the two different (dual) topological models of pixel connectivity.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
