Related papers: Curvature Sets Over Persistence Diagrams
The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…
The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex,…
Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…
A persistence diagram is a finite multiset of birth-death pairs representing the lifetimes of topological features across a filtration. Persistence diagrams do not carry intrinsic spectral or kernel structures, so applications typically use…
The Sobolev regularity of invariant measures for diffusion processes is proved on non-smooth metric measure spaces with synthetic lower Ricci curvature bounds. As an application, the symmetrizability of semigroups is characterized, and the…
In this document, we propose a bridge between the graphs and the geometric realizations of their Vietoris Rips complexes, i.e. Graphs, with their canonical \v{C}ech closure structure, have the same homotopy type that the realization of…
We develop the technique of compactified correspondences and homotopies over one-dimensional base schemes, and illuminate the perfectness and the inverting of characteristic assumptions from the celebrating Voevodsky's strict homotopy…
Our aim is to study invariant hypersurfaces immersed in the Euclidean space $\mathbb{R}^{n+1}$, whose mean curvature is given as a linear function in the unit sphere $\mathbb{S}^n$ depending on its Gauss map. These hypersurfaces are closely…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
We study 1-parameter families in the space $\mathscr{M}^G_1$ of $G$-invariant, unit volume metrics on a given compact, connected, almost-effective homogeneous space $M=G/H$. In particular, we focus on diverging sequences, i.e. which are not…
In this article we develop a graphical calculus for stable invariants of Riemannian manifolds akin to the graphical calculus for Rozansky-Witten invariants for hyperk\"ahler manifolds; based on interpreting trivalent graphs with colored…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
We consider the degree-Rips construction from topological data analysis, which provides a density-sensitive, multiparameter hierarchical clustering algorithm. We analyze its stability to perturbations of the input data using the…
Metrics obtained by integrating within the generalised invariant formalism are structured around their intrinsic coordinates, and this considerably simplifies their invariant classification and symmetry analysis. We illustrate this by…
Computation of the simplicial complexes of a large point cloud often relies on extracting a sample, to reduce the associated computational burden. The study considers sampling critical points of a Morse function associated to a point cloud,…
The Vapnik-Chervonenkis dimension (in short, VC-dimension) of a graph is defined as the VC-dimension of the set system induced by the neighborhoods of its vertices. We show that every $n$-vertex graph with bounded VC-dimension contains a…
The persistence diagram is a central object in the study of persistent homology and has also been investigated in the context of random topology. The more recent notion of the verbose diagram (a.k.a. verbose barcode) is a refinement of the…
Invariant circles play an important role as barriers to transport in the dynamics of area-preserving maps. KAM theory guarantees the persistence of some circles for near-integrable maps, but far from the integrable case all circles can be…
Persistent homology is a relatively new tool often used for \emph{qualitative} analysis of intrinsic topological features in images and data originated from scientific and engineering applications. In this paper, we report novel…
Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this…