Related papers: Girth, magnitude homology, and phase transition of…
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 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…
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…
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…
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 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…
Magnitude homology is a bigraded homology theory for finite graphs defined by Hepworth and Willerton, categorifying the power series invariant known as magnitude which was introduced by Leinster. We analyze the structure and implications of…
Magnitude is a numerical invariant of enriched categories, including in particular metric spaces as $[0,\infty)$-enriched categories. We show that in many cases magnitude can be categorified to a homology theory for enriched categories,…
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…
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…
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…
The magnitude of a graph is one of a family of cardinality-like invariants extending across mathematics; it is a cousin to Euler characteristic and geometric measure. Among its cardinality-like properties are multiplicativity with respect…
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.…
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.…
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…
Magnitude homology was introduced by Hepworth and Willerton in the case of graphs, and was later extended by Leinster and Shulman to metric spaces and enriched categories. Here we introduce the dual theory, magnitude cohomology, which we…
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…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
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…