Related papers: Randomized simplicial sets
Topological spaces - such as classifying spaces, configuration spaces and spacetimes - often admit extra temporal structure. Qualitative invariants on such directed spaces often are more informative yet more difficult to calculate than…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…
A simplicial set is said to be non-singular if its non-degenerate simplices are embedded. Let $sSet$ denote the category of simplicial sets. We prove that the full subcategory $nsSet$ whose objects are the non-singular simplicial sets…
A crucial step in the analysis of persistent homology is the transformation of data into an appropriate topological object (in our case, a simplicial complex). Modern packages for persistent homology often construct Vietoris--Rips or other…
Given a Poisson process on a $d$-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are given by the \u{C}ech complex associated to the coverage of…
Let $D$ be a large category which is cocomplete. We construct a model structure (in the sense of Quillen) on the category of small functors from $D$ to simplicial sets. As an application we construct homotopy localization functors on the…
We study random simplicial complexes in the multi-parameter upper model. In this model simplices of various dimensions are taken randomly and independently, and our random simplicial complex $Y$ is then taken to be the minimal simplicial…
We exhibit a Quillen equivalence between two model categories encoding the homotopy theory of stratified spaces : the model category of filtered simplicial sets, and that of filtered spaces. Additionally, we introduce a new class of…
We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…
In this paper, a quantum computational framework for algebraic topology based on simplicial set theory is presented. This extends previous work, which was limited to simplicial complexes and aimed mostly to topological data analysis. The…
The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…
In this article, we construct a cofibrantly generated model structure on the category of spaces stratified over a fixed poset, and show that it is Quillen-equivalent to a category of diagrams of simplicial sets. Then, considering all those…
In this paper we establish a natural definition of Lusternik-Schnirelmann category for simplicial complexes via the well known notion of contiguity. This category has the property of being homotopy invariant under strong equivalences, and…
This paper takes its starting point in an idea of Grothendieck on the representation of homotopy types. We show that any locally finite nilpotent homotopy can be represented by a simplicial set which is a finitely generated free group in…
We present a new approach to simple homotopy theory of polyhedra using finite topological spaces. We define the concept of collapse of a finite space and prove that this new notion corresponds exactly to the concept of a simplicial…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…
Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…
We propose a new method to define theories of random geometries, using an explicit and simple map between metrics and large hermitian matrices. We outline some of the many possible applications of the formalism. For example, a…