Related papers: Differential Calculus on Hypergraphs and Mayer-Vie…
Let $X=\C^n$. In this paper we present an algorithm that computes the de Rham cohomology groups $H^i_{dR}(U,\C)$ where $U$ is the complement of an arbitrary Zariski-closed set $Y$ in $X$. Our algorithm is a merger of the algorithm given by…
We introduce diagrammatic differentiation for tensor calculus by generalising the dual number construction from rigs to monoidal categories. Applying this to ZX diagrams, we show how to calculate diagrammatically the gradient of a linear…
A challenge in computational topology is to deal with large filtered geometric complexes built from point cloud data such as Vietoris-Rips filtrations. This has led to the development of schemes for parallel computation and compression…
Understanding the structure of high-dimensional data is fundamental to neuroscience and other data-intensive scientific fields. While persistent homology effectively identifies basic topological features such as "holes," it lacks the…
Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that…
Directed graphs arise in many applications where computing persistent homology helps to encode the shape and structure of the input information. However, there are only a few ways to turn the directed graph information into an undirected…
We show that the hypercohomology of the Chevalley-Eilenberg-de Rham complex of a Lie algebroid L over a scheme with coefficients in an L-module can be expressed as a derived functor. We use this fact to study a Hochschild-Serre type…
In this paper, we consider topological featurizations of data defined over simplicial complexes, like images and labeled graphs, obtained by convolving this data with various filters before computing persistence. Viewing a convolution…
We introduce the degree filtration on the discrete cubical chain complex of a graph, defined in terms of the maximal injective dimension of the facets of singular $n$-cubes, and study the degree spectral sequence which arises from this…
We develop a version of the Bass-Serre theory for Lie algebras (over a field $k$) via a homological approach. We define the notion of fundamental Lie algebra of a graph of Lie algebras and show that this construction yields Mayer-Vietoris…
We establish an isomorphism between the 0-degree \"uberhomology and the double homology of finite simplicial complexes, using a Mayer-Vietoris spectral sequence argument. We clarify the correspondence between these theories by providing…
The persistent homology of a stationary point process on ${\bf R}^N$ is studied in this paper. As a generalization of continuum percolation theory, we study higher dimensional topological features of the point process such as loops,…
We show the existence of length-constrained expander decomposition in directed graphs and undirected vertex-capacitated graphs. Previously, its existence was shown only in undirected edge-capacitated graphs [Haeupler-R\"acke-Ghaffari, STOC…
We prove that the hairy graph complex with the extra differential is almost acyclic. This justifies the construction of hairy graph cohomology classes by the waterfall mechanism. The main idea used in the paper is a new differential,…
We discuss the Mayer-Vietoris spectral sequence as an invariant in the context of persistent homology. In particular, we introduce the notion of $\varepsilon$-acyclic carriers and $\varepsilon$-acyclic equivalences between filtered regular…
We characterize structures such as monotonicity, convexity, and modality in smooth regression curves using persistent homology. Persistent homology is a key tool in topological data analysis that detects higher-dimensional topological…
Numerous models for supervised and reinforcement learning benefit from combinations of discrete and continuous model components. End-to-end learnable discrete-continuous models are compositional, tend to generalize better, and are more…
Persistent homology is a method for computing the topological features present in a given data. Recently, there has been much interest in the integration of persistent homology as a computational step in neural networks or deep learning. In…
The theory of path homology for digraphs was developed by Alexander Grigor'yan, Yong Lin, Yuri Muranov, and Shing-Tung Yau. In this paper, we consider the differential algebras on digraphs and define the parametrized homology of digraphs as…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…