2021
DOI: 10.4310/hha.2021.v23.n1.a16
|View full text |Cite
|
Sign up to set email alerts
|

Geometric approach to graph magnitude homology

Abstract: In this paper, we introduce a new method to compute the magnitude homology of general graphs. To each direct sum component of the magnitude chain complexes, we assign a pair of simplicial complexes whose simplicial chain complex is isomorphic to it. First we state our main theorem specialized to trees, which gives another proof for the known fact that trees are diagonal. After that, we consider general graphs, which may have cycles. We also demonstrate some computation as an application.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
17
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(18 citation statements)
references
References 20 publications
1
17
0
Order By: Relevance
“…It should be noted that this space has already been dealt with in previous works by Hepworth-Willerton [14] (for graphs) and Bottinelli-Kaiser [5] (for metric spaces). Asao-Izumihara [3] has also constructed a closely related space for graphs. One of the most crucial points in [3] was the introduction of the "time parameter t" to specify the vertex (x t , t) in the simplicial complex.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…It should be noted that this space has already been dealt with in previous works by Hepworth-Willerton [14] (for graphs) and Bottinelli-Kaiser [5] (for metric spaces). Asao-Izumihara [3] has also constructed a closely related space for graphs. One of the most crucial points in [3] was the introduction of the "time parameter t" to specify the vertex (x t , t) in the simplicial complex.…”
Section: Introductionmentioning
confidence: 99%
“…Asao-Izumihara [3] has also constructed a closely related space for graphs. One of the most crucial points in [3] was the introduction of the "time parameter t" to specify the vertex (x t , t) in the simplicial complex.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, whole picture of the behavior of magnitude is unrevealed, and that is attracting people in several areas of mathematics. In particular, magnitude of finite graphs, which takes values in formal power series with Z-coefficients, is studied by several authors so far ( [1], [3], [8], [9], [11]). Throughout this article, we call a finite, simple, and undirected graph without loops just a graph.…”
Section: Introductionmentioning
confidence: 99%
“…This paper is organized as follows. In §2, we recall the definition of magnitude and magnitude homology of graphs, and introduce Asao-Izumihara complex following [2]. In §3, We describe the homotopy type of the Asao-Izumihara complex corresponding to pawful graphs.…”
Section: Introductionmentioning
confidence: 99%