相关论文: Eulerian magnitude homology: diagonality, injectiv…
In this paper we explore the connection between the ranks of the magnitude homology groups of a graph and the structure of its subgraphs. To this end, we introduce variants of magnitude homology called eulerian magnitude homology and…
In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…
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…
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,…
In this paper, we introduce a new method to compute magnitude homology of general graphs. To each direct sum component of magnitude chain complexes, we assign a pair of simplicial complexes whose simplicial chain complex is isomorphic to…
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…
The last decade has seen the development of path homology and magnitude homology -- two homology theories of directed graphs, each satisfying classic properties such as Kunneth and Mayer-Vietoris theorems. Recent work of Asao has shown that…
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…
In this article, we analyze the structure and relationships between magnitude homology and Eulerian magnitude homology of finite graphs. Building on the work of Kaneta and Yoshinaga, Sazdanovic and Summers, and Asao and Izumihara, we…
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…
We define and study the magnitude and magnitude homology of a real hyperplane arrangement by regarding its tope graph as a metric space. We prove several structural results for the magnitude of arrangements, including a symmetry formula,…
Magnitude homology is an emerging framework that captures the intrinsic topological and geometric features of metric spaces, demonstrating significant potential for topoplogical data analysis and geometric data analysis. This work…
We compute magnitude homology of various graphs using algebraic Morse theory. Specifically, we (1) give an alternative proof that trees are diagonal, (2) identify a new class of diagonal graphs, (3) prove that the icosahedral graph is…
This paper studies combinatorial properties of the 'complex of planar injective words', a chain complex of modules over the Temperley-Lieb algebra that arose in our work on homological stability. Despite being a linear rather than a…
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…
We provide a characterization of two types of directed homology for fully-connected, feedforward neural network architectures. These exact characterizations of the directed homology structure of a neural network architecture are the first…
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…
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…
In this article, we give a framework for studying the Euler characteristic and its categorification of objects across several areas of geometry, topology and combinatorics. That is, the magnitude theory of filtered sets enriched categories.…
We make calculations in graph homology which further understanding of the topology of spaces of string links, in particular calculating the Euler characteristics of finite-dimensional summands in their homology and homotopy. In doing so, we…