194 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Laboratoire de Mathématiques d'OrsayFR12 papers
- Institut national de recherche en sciences et technologies du numériqueFR9 papers
- Centre Inria de SaclayFR7 papers
- Laboratoire de Probabilités, Statistique et ModélisationFR6 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- Université Paris-SaclayFR4 papers
- Centre Inria d'Université Côte d'AzurFR3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
- Institut de Mathématiques de ToulouseFR3 papers
- Institut National des Sciences Appliquées de ToulouseFR3 papers
- Université Toulouse III - Paul SabatierFR3 papers
- University of PotsdamDE3 papers
7 papers · 1 filter
Recovering the homology of immersed manifolds
Raphaël Tinarrage
Given a sample of an abstract manifold immersed in some Euclidean space, we describe a way to recover the singular homology of the original manifold. It consists in estimating its…
ATOL: Measure Vectorization for Automatic Topologically-Oriented Learning
Martin Royer, Frédéric Chazal, Clément Levrard +2
Robust topological information commonly comes in the form of a set of persistence diagrams, finite measures that are in nature uneasy to affix to generic machine learning framework…
Understanding the Topology and the Geometry of the Space of Persistence Diagrams via Optimal Partial Transport
Vincent Divol, Théo Lacombe
Despite the obvious similarities between the metrics used in topological data analysis and those of optimal transport, an optimal-transport based formalism to study persistence dia…
On Order Types of Random Point Sets
Olivier Devillers, Philippe Duchon, Marc Glisse +1
A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way…
Strong Collapse for Persistence
Jean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek
We introduce a fast and memory efficient approach to compute the persistent homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the…
The density of expected persistence diagrams and its kernel based estimation
Frédéric Chazal, Vincent Divol
Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discre…
The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology
Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria
The persistent homology with coefficients in a field F coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm fo…