Related papers: Homological aspects of oriented hypergraphs
In this paper we study graph burnings using methods of algebraic topology. We prove that the time function of a burning is a graph map to a path graph. Afterwards, we define a category whose objects are graph burnings and morphisms are…
Homological algebra is often understood as the translator between the world of topology and algebra. However, this branch of mathematics is worth studying by itself, given that it provides fascinating perspectives about other disciplines,…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
Simplicial homology manifolds are proposed as an interesting class of geometric objects, more general than topological manifolds but still quite tractable, in which questions about the microstructure of space-time can be naturally…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
Persistent homology theory is a relatively new but powerful method in data analysis. Using simplicial complexes, classical persistent homology is able to reveal high dimensional geometric structures of datasets, and represent them as…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
The main question we target is the following: If one fixes a topological type of a complex normal surface singularity then what are the possible analytic types supported by it, and/or, what are the possible values of the geometric genus? We…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
We give explicit formulas for the asymptotic Betti numbers, over an arbitrary field, of the ordered configuration spaces of a graph. In characteristic zero, we further give explicit formulas for the asymptotic multiplicities in homology of…
Persistent homology is a topological data analysis tool that has been widely generalized, extending its scope beyond the field of topology. Among its extensions, steady and ranging persistence were developed to study a wide variety of graph…
We define a construction on operads which yields a new description of the minimal model. The construction also allows us to define algebraic structures on the homology of chain complexes with homologously trivial operad algebra structures,…
We introduce a persistent Hochschild homology framework for directed graphs. Hochschild homology groups of (path algebras of) directed graphs vanish in degree $i\geq 2$. To extend them to higher degrees, we introduce the notion of…
We review Heisenberg homology of configurations in once bounded surfaces and extend the construction to the regular thickening of a finite graph with ribbon structure.
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…
The symmetric homology of a unital associative algebra $A$ over a commutative ground ring $k$, denoted $HS_*(A)$, is defined using derived functors and the symmetric bar construction of Fiedorowicz. In this paper we show that $HS_*(A)$…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…