相关论文: The Shadow of Vietoris--Rips Complexes in Limits

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

We derive conditions under which the reconstruction of a target space is topologically correct via the \v{C}ech complex or the Vietoris-Rips complex obtained from possibly noisy point cloud data. We provide two novel theoretical results.…

We show that if $X$ is a finite-dimensional Polish metric space, then the natural bijection $\mathrm{VR}(X;r)\to \mathrm{VR^m}(X;r)$ from the (open) Vietoris-Rips complex to the Vietoris-Rips metric thickening is a homotopy equivalence.…

Let $A$ be a unital $C^*$-algebra and $H$ a Hilbert space. The cone $\CP(A,B(H))$ of completely positive maps carries the Bures metric $\beta$, closely related to the cb-norm. We introduce a family of Bures--Kuratowski (BK) metrics on…

We construct a compact subset K of the four dimensional Euclidean space with the following property: For all values of the parameter in an interval, the Vietoris-Rips complex of K has uncountably generated first homology. This answers a…

We determine the homotopy type of the Vietoris-Rips complexes of the (vertex sets of the) platonic solids. The most interesting case is that the Vietoris-Rips complex of the dodecahedron is a wedge of nine 3-spheres when the parameter is…

The Vietoris-Rips filtration, the standard filtration on metric data in topological data analysis, is notoriously sensitive to outliers. Sheehy's subdivision-Rips bifiltration $\mathcal{SR}(-)$ is a density-sensitive refinement that is…

In any CAT(k) space M, the "shadow" of a tangent vector Z at a point p is the set vectors that form an angle of \pi or more with Z. Taking logarithm maps at points approaching p along a fixed geodesic ray from p with tangent Z collapses the…

We introduce a new invariant defined on the vertices of a given filtered simplicial complex, called codensity, which controls the impact of removing vertices on persistent homology. We achieve this control through the use of an interleaving…

For a CAT(0) cube complex $\mathbf X$, we define a simplicial flag complex $\partial_\Delta\mathbf X$, called the \emph{simplicial boundary}, which is a natural setting for studying non-hyperbolic behavior of $\mathbf X$. We compare…

We study simplicial complexes with a given number of vertices whose Stanley-Reisner ring has the minimal possible Betti numbers. We find that these simplicial complexes have very special combinatorial and topological structures. For…

Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…

Inspired by a Blaschke's work about analytic convex surfaces, we study {\em shadow boundaries} of Riemannian submanifolds $M$, which are defined by a parallel vector field along $M$. Since a shadow boundary is just a closed subset of $M$,…

We study combinatorial connectivity for two models of random geometric complexes. These two models - \v{C}ech and Vietoris-Rips complexes - are built on a homogeneous Poisson point process of intensity $n$ on a $d$-dimensional torus using…

We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity rho(S) of S is given by the smallest number of reflex vertices in a simple polygonalization of S.…

A finite-dimensional CAT(0) cube complex $X$ is equipped with several well-studied boundaries. These include the Tits boundary (which depends on the CAT(0) metric), the Roller boundary (which depends only on the combinatorial structure),…

We study the simplex method over polyhedra satisfying certain "discrete curvature" lower bounds, which enforce that the boundary always meets vertices at sharp angles. Motivated by linear programs with totally unimodular constraint…

We give an $O(n^2(k+\log n))$ algorithm for computing the $k$-dimensional persistent homology of a filtration of clique complexes of cyclic graphs on $n$ vertices. This is nearly quadratic in the number of vertices $n$, and therefore a…

Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips…

We begin the study the algebraic topology of semi-coarse spaces, which are generalizations of coarse spaces that enable one to endow non-trivial `coarse-like' structures to compact metric spaces, something which is impossible in coarse…