Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Magnitude homology and Path homology (2201.08047v3)

Published 20 Jan 2022 in math.AT

Abstract: 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 homologies of a digraph $G$, which make them chain complexes. Then we show that its homology ${\mathcal MH}{\ell}_k(G)$ is non-trivial and homotopy invariant in the context of `homotopy theory of digraphs' developed by Grigor'yan--Muranov--S.-T. Yau et al (G-M-Ys in the following). It is remarkable that the diagonal part of our homology ${\mathcal MH}{k}_k(G)$ is isomorphic to the reduced path homology $\tilde{H}_k(G)$ also introduced by G-M-Ys. Further, we construct a spectral sequence whose first page is isomorphic to magnitude homology ${\mathrm MH}{\ell}_k(G)$, and the second page is isomorphic to our homology ${\mathcal MH}{\ell}_k(G)$. As an application, we show that the diagonality of magnitude homology implies triviality of reduced path homology. We also show that $\tilde{H}_k(g) = 0$ for $k \geq 2$ and $\tilde{H}_1(g) \neq 0$ if any edges of an undirected graph $g$ is contained in a cycle of length $\geq 5$.

Summary

We haven't generated a summary for this paper yet.