Related papers: Two graph homologies and the space of long embeddi…
We continue our investigation of spaces of long embeddings (long embeddings are high-dimensional analogues of long knots). In previous work we showed that when the dimensions are in the stable range, the rational homology groups of these…
We study the cohomology of the hairy graph complexes which compute the rational homotopy of embedding spaces, generalizing the Vassiliev invariants of knot theory. We provide spectral sequences converging to zero whose first pages contain…
Arone and Turchin defined graph-complexes computing the rational homotopy of the spaces of long embeddings. The graph-complexes split into a direct sum by the number of loops in graphs. In this paper we compute the homology of its two-loop…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
Configuration space integrals are powerful tools for studying the homotopy type of the space of long embeddings in terms of a combinatorial object called a graph complex. It is unknown whether these integrals give a cochain map due to…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We express the hairy graph complexes computing the rational homotopy groups of long embeddings (modulo immersion) of R^m in R^n as "decorated" graph complexes associated to certain representations of the outer automorphism groups of free…
We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…
A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We introduce graphcodes, a novel multi-scale summary of the topological properties of a dataset that is based on the well-established theory of persistent homology. Graphcodes handle datasets that are filtered along two real-valued scale…
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,…
We introduce a new topological invariant of complex line arrangements in the complex projective plane, derived from the interaction between their complement and the boundary of a regular neighbourhood. The motivation is to identify Zariski…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
Stable topological invariants are a cornerstone of persistence theory and applied topology, but their discriminative properties are often poorly-understood. In this paper we study a rich homology-based invariant first defined by Dey, Shi,…