Related papers: Computing Persistent Homology within Coq/SSReflect
Persistence homology is a tool used to measure topological features that are present in data sets and functions. Persistence pairs births and deaths of these features as we iterate through the sublevel sets of the data or function of…
We use persistent homology to build a quantitative understanding of large complex systems that are driven far-from-equilibrium; in particular, we analyze image time series of flow field patterns from numerical simulations of two important…
Topological data analysis offers a robust way to extract useful information from noisy, unstructured data by identifying its underlying structure. Recently, an efficient quantum algorithm was proposed [Lloyd, Garnerone, Zanardi, Nat.…
The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
The Coq Platform is a continuously developed distribution of the Coq proof assistant together with commonly used libraries, plugins, and external tools useful in Coq-based formal verification projects. The Coq Platform enables reproducing…
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…
We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 \leq k \leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique…
Persistent homology is a natural tool for probing the topological characteristics of weighted graphs, essentially focusing on their $0$-dimensional homology. While this area has been substantially studied, we present a new approach to…
The Persistent Homology Transform (PHT) summarizes a shape in $\mathbb{R}^m$ by collecting persistence diagrams obtained from linear height filtrations in all directions on $\mathbb{S}^{m-1}$. It enjoys strong theoretical guarantees,…
Qualitative methods such as the linear sampling method and the factorization method reconstruct acoustic scatterers through sampling indicators. In practice, these indicators are gray-scale fields on a prescribed sampling window and a…
Persistent homology is a cornerstone of topological data analysis, offering a multiscale summary of topology with robustness to nuisance transformations, such as rotations and small deformations. Persistent homology has seen broad use…
The main aim of this paper is to explore the ideas of persistent homology and extended persistent homology, and their stability theorems, using ideas from [Bubenik and Scott, 2014; Cohen-Steiner, Edelsbrunner, and Harer, 2007; and…
We propose a new library to model and verify hardware circuits in the Coq proof assistant. This library allows one to easily build circuits by following the usual pen-and-paper diagrams. We define a deep-embedding: we use a (dependently…
The Betti numbers of a graded module over the polynomial ring form a table of numerical invariants that refines the Hilbert polynomial. A sequence of papers sparked by conjectures of Boij and S\"oderberg have led to the characterization of…
In topological data analysis, persistent homology characterizes robust topological features in data and it has a summary representation, called a persistence diagram. Statistical research for persistence diagrams have been actively…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…
A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
Persistent homology typically studies the evolution of homology groups $H_p(X)$ (with coefficients in a field) along a filtration of topological spaces. $A_\infty$-persistence extends this theory by analysing the evolution of subspaces such…