Related papers: The reachability homology of a directed graph
Two important invariants of directed graphs, namely magnitude homology and path homology, have recently been shown to be intimately connected: there is a 'magnitude-path spectral sequence' or 'MPSS' in which magnitude homology appears as…
The magnitude homology, introduced by R. Hepworth and S. Willerton, offers a topological invariant that enables the study of graph properties. Hypergraphs, being a generalization of graphs, serve as popular mathematical models for data with…
Magnitude homology of graphs is introduced by Hepworth and Willerton in arXiv:1505.04125 . Magnitude homology of arbitrary metric spaces by Leinster and Shulman in arXiv:1711.00802v2 . We verify that the K\"unneth and Mayer-Vietoris…
This paper studies the magnitude homology of graphs focusing mainly on the relationship between its diagonality and the girth. Magnitude and magnitude homology are formulations of the Euler characteristic and the corresponding homology,…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
In this paper we explore the algebraic structure and combinatorial properties of eulerian magnitude homology. First, we analyze the diagonality conditions of eulerian magnitude homology, providing a characterization of complete graphs.…
In this article, we show that magnitude homology and path homology are closely related, and we give some applications. We define differentials ${\mathrm MH}^{\ell}_k(G) \longrightarrow {\mathrm MH}^{\ell-1}_{k-1}(G)$ between magnitude…
We introduce Mayer path homology, a new homology theory for directed path complexes obtained by equipping path complexes with an $N$-nilpotent differential. The main novelty of this work is the introduction of an $N$-differential on path…
The fundamental group of a directed graph admits a natural sequence of quotient groups called $r$-fundamental groups, and the $r$-fundamental groups can capture properties of a directed graph that the fundamental group cannot capture. The…
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…
Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this…
The magnitude of a graph can be thought of as an integer power series associated to a graph; Leinster introduced it using his idea of magnitude of a metric space. Here we introduce a bigraded homology theory for graphs which has the…
Magnitude is a numerical invariant of metric spaces and graphs, analogous, in a precise sense, to Euler characteristic. Magnitude homology is an algebraic invariant constructed to categorify magnitude. Among the important features of the…
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…
The aim of this paper is to apply the framework, which was developed by Sam and Snowden, to study structural properties of graph homologies, in the spirit of Ramos, Miyata and Proudfoot. Our main results concern the magnitude homology of…
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a…
The Euler characteristic is an invariant of a topological space that in a precise sense captures its canonical notion of size, akin to the cardinality of a set. The Euler characteristic is closely related to the homology of a space, as it…
We introduce the weighted path homology on the category of weigh\-ted directed hypergraphs and describe conditions of homotopy invariance of weighted path homology groups. We give several examples that explain the nontriviality of the…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…