Related papers: Persistent homological Quillen-McCord theorem
In this paper, we establish a persistence version of the Quillen-McCord theorem for persistence finite posets. Given a map $f \colon P \rightarrow Q$ between persistence finite posets $P$ and $Q$ with weakly $\varepsilon$-contractible…
We prove an extension of the Quillen Theorem Bn for homotopy fibres to a similar result for homotopy pullbacks and use this to obtain sufficient conditions on a pullback diagram of categories to guarantee that it be a homotopy pullback.
A theorem of McCord of 1966 and Quillen's Theorem A of 1973 provide sufficient conditions for a map between two posets to be a homotopy equivalence at the level of complexes. We give an alternative elementary proof of this result and we…
Persistence has proved to be a valuable tool to analyze real world data robustly. Several approaches to persistence have been attempted over time, some topological in flavor, based on the vector space-valued homology functor, other…
Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…
We extend the Quillen Theorem Bn for homotopy fibers of Dwyer, et al. to similar results for homotopy pullbacks and note that these results imply similar results for zigzags in the categories of relative categories and k-relative…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
Persistent homology, a central tool of topological data analysis, provides invariants of data called barcodes (also known as persistence diagrams). A barcode is simply a multiset of real intervals. Recent work of Edelsbrunner, Jablonski,…
This paper explores persistence modules for circle-valued functions, presenting a new extension of the interleaving and bottleneck distances in this setting. We propose a natural generalisation of barcodes in terms of arcs on a geometric…
Given a selfmap $f:X\to X$ on a compact connected polyhedron $X$, H. Schirmer gave necessary and sufficient conditions for a nonempty closed subset $A$ to be the fixed point set of a map in the homotopy class of $f$. R. Brown and C.…
We prove that the stabilization of spaces functor---the classical construction of associating a spectrum to a pointed space by tensoring with the sphere spectrum---satisfies homotopical descent on objects and morphisms. This is the…
We introduce topological conditions on a broad class of functionals that ensure that the persistent homology modules of their associated sublevel set filtration admit persistence diagrams, which, in particular, implies that they satisfy…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
We provide a version of Quillen's homological stability criterion for continuous bounded cohomology. This criterion is exploited in the companion paper (arXiv:2201.03879) in order to derive new bounded cohomological stability results for…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
This paper proves that the q-model structures of Moore flows and of multipointed $d$-spaces are Quillen equivalent. The main step is the proof that the counit and unit maps of the Quillen adjunction are isomorphisms on the q-cofibrant…
We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…
The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…
We present a way of constructing a Quillen model structure on a full subcategory of an elementary topos, starting with an interval object with connections and a certain dominance. The advantage of this method is that it does not require the…