Related papers: Flagifying the Dowker Complex
Given a relation on $ X \times Y $, we can construct two abstract simplicial complexes called Dowker complexes. The geometric realizations of these simplicial complexes are homotopically equivalent. We show that if two relations are…
We propose a categorification of the Dowker duality theorem for relations. Dowker's theorem states that the Dowker complex of a relation $R \subseteq X \times Y$ of sets $X$ and $Y$ is homotopy equivalent to the Dowker complex of the…
Using ideas of the Dowker duality we prove that the Rips complex at scale $r$ is homotopy equivalent to the nerve of a cover consisting of sets of prescribed diameter. We then develop a functorial version of the Nerve theorem coupled with…
Given a relation $R \subseteq I \times J$ between two sets, Dowker's Theorem (1952) states that the homology groups of two associated simplicial complexes, now known as Dowker complexes, are isomorphic. In its modern form, the full result…
We construct a simplicial complex, the rectangle complex of a relation R, and show that it is homotopy equivalent to the Dowker complex of R. This results in a short and conceptual proof of functorial versions of Dowker's Theorem used in…
This paper presents three short, new proofs of Dowker duality using various poset fiber lemmas. We introduce modifications of joins and products of simplicial complexes called relational join and relational product complexes. These…
Fix a finite set of points in Euclidean $n$-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an…
The Dowker theorem is a classical result in the topology of finite spaces, claiming that any binary relation between two finite spaces defines two homotopy-equivalent complexes (the Dowker complexes). Recently, Barmak strengthened this to a…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
The Dowker complex is an abstract simplicial complex that is constructed from a binary relation in a straightforward way. Although there are two ways to perform this construction -- vertices for the complex are either the rows or the…
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 develop a framework for computing the homology of weighted simplicial complexes with coefficients in a discrete valuation ring. A weighted simplicial complex, $(X,v)$, introduced by Dawson [Cah. Topol. G\'{e}om. Diff\'{e}r. Cat\'{e}g. 31…
We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…
By their nature it is difficult to differentiate chaotic dynamical systems through measurement. In recent years, work has begun on using methods of Topological Data Analysis (TDA) to qualitatively type dynamical data by approximating the…
Higher-order networks are able to capture the many-body interactions present in complex systems and to unveil new fundamental phenomena revealing the rich interplay between topology, geometry, and dynamics. Simplicial complexes are…
In this paper, we introduce new density-sensitive bifiltrations for data using the framework of Dowker complexes. Previously, Dowker complexes were studied to address directional or bivariate data whereas density-sensitive bifiltrations on…
Motivated by applications in Topological Data Analysis, we consider decompositions of a simplicial complex induced by a cover of its vertices. We study how the homotopy type of such decompositions approximates the homotopy of the simplicial…
Rips complexes are important structures for analyzing topological features of metric spaces. Unfortunately, generating these complexes is expensive because of a combinatorial explosion in the complex size. For $n$ points in $\mathbb{R}^d$,…
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…
Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. A major obstacle to…