Related papers: Rips Complexes of Planar Point Sets
We study the Linial--Meshulam model of random two-dimensional simplicial complexes. One of our main results states that for $p\ll n^{-1}$ a random 2-complex $Y$ collapses simplicially to a graph and, in particular, the fundamental group…
An isomorphism of symplectically tame smooth pseudocomplex structures on the complex projective plane which is a homeomorphism and differentiable of full rank at two points is smooth.
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
We study the homotopy types of spaces of algebraic (rational) maps from real projective spaces into complex projective spaces. In a previous paper we have shown that the inclusion of the first space into the second one is a homotopy…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
A topological group is (openly) almost-elliptic if it contains a(n open) dense subset of elements generating relatively-compact cyclic subgroups. We classify the (openly) almost-elliptic connected locally compact groups as precisely those…
In this paper we define, implement, and investigate a simplicial complex construction for computing persistent homology of Euclidean point cloud data, which we call the Delaunay-Rips complex (DR). Assigning the Vietoris-Rips weights to…
We show that diagram groups can be viewed as fundamental groups of spaces of positive paths on directed 2-complexes (these spaces of paths turn out to be classifying spaces). Thus diagram groups are analogs of second homotopy groups,…
This paper shows that the topological structures of particle orbits generated by a generic class of vector fields on spherical surfaces, called {\it the flow of finite type}, are in one-to-one correspondence with discrete structures such as…
We prove that holomorphic maps from an open subset of a complex smooth projective curve to a complex smooth projective rationally simply connected variety can be approximated by algebraic maps for the compact-open topology. This theorem can…
Characterizing the homotopy types of the Vietoris--Rips complexes of a metric space $X$ is in general a difficult problem. The Vietoris--Rips metric thickening, a metric space analogue of the Vietoris--Rips complex, was introduced as a…
We extend the notion of the distance to a measure from Euclidean space to probability measures on general metric spaces as a way to do topological data analysis in a way that is robust to noise and outliers. We then give an efficient way to…
Split-metric decompositions are an important tool in the theory of phylogenetics, particularly because of the link between the tight span and the class of totally decomposable spaces, a generalization of metric trees whose decomposition…
We introduce the monoidal Rips filtration, a filtered simplicial set for weighted directed graphs and other lattice-valued networks. Our construction generalizes the Vietoris-Rips filtration for metric spaces by replacing the maximum…
Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…
A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or…