相关论文: Graph magnitude homology via algebraic Morse theor…

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…

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,…

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 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…

We compute numerically the homology of several graph complexes in low loop orders, extending previous results.

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…

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…

Asao-Ivanov showed that magnitude homology is a Tor functor, hence we can compute it by giving a projective resolution of a certain module. In this article, we compute magnitude homology by constructing a minimal projective resolution. As a…

We study Morse theory on noncompact manifolds equipped with exhaustions by compact pieces, defining the Morse homology of a pair which consists of the manifold and related geometric/homotopy data. We construct a collection of Morse data…

In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…

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 define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…

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…

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…

We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…

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…

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…

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.…