Related papers: Computing singular simplicial homologies of digrap…
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then…
Simplicial complexes are generalized network structures able to encode interactions occurring between more than two nodes. Simplicial complexes describe a large variety of complex interacting systems ranging from brain networks, to social…
Persistent homology is a natural tool for probing the topological characteristics of weighted graphs, essentially focusing on their $0$-dimensional homology. While this area has been substantially studied, we present a new approach to…
Simplicial type theory extends homotopy type theory with a directed path type which internalizes the notion of a homomorphism within a type. This concept has significant applications both within mathematics -- where it allows for synthetic…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…
A spectral sequence calculating the homology groups of some spaces of maps equivariant under compact group actions is described. For the main example, we calculate the rational homology groups of spaces of even and odd maps $S^m \to S^M$,…
Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as "tournaplexes", whose simplices are tournaments. In particular, given a digraph…
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 extend the notion of simplicial set with effective homology to diagrams of simplicial sets. Further, for a given finite diagram of simplicial sets $X \colon \mathcal{I} \to \mathsf{sSet}$ such that each simplicial set $X(i)$ has…
We study the inverse problem for persistent homology: For a fixed simplicial complex $K$, we analyse the fiber of the continuous map $\mathrm{PH}$ on the space of filters that assigns to a filter $f: K \to \mathbb R$ the total barcode of…
Hypergraphs and simplical complexes both capture the higher-order interactions of complex systems, ranging from higher-order collaboration networks to brain networks. One open problem in the field is what should drive the choice of the…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
Homotopy links have proven to be one of the most powerful tools of stratified homotopy theory. In previous work, we described combinatorial models for the generalized homotopy links of a stratified simplicial set. For many purposes, in…
In this paper, we study the discrete differential calculus on hypergraphs by using the Kouzul complexes. We define the constrained (co)homology for hypergraphs and give the corresponding Mayer-Vietoris sequences. We prove the functoriality…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
Intersection homology is a topological invariant which detects finer information in a space than ordinary homology. Using ideas from classical simple homotopy theory, we construct local combinatorial transformations on simplicial complexes…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and…
Graphs are commonly used to encode relationships among entities, yet their abstractness makes them difficult to analyze. Node-link diagrams are popular for drawing graphs, and force-directed layouts provide a flexible method for node…