Magnitude homology and Path homology
arXiv:2201.08047
Abstract
In this article, we show that magnitude homology and path homology are closely related, and we give some applications. We define differentials between magnitude homologies of a digraph , which make them chain complexes. Then we show that its homology 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 is isomorphic to the reduced path homology also introduced by G-M-Ys. Further, we construct a spectral sequence whose first page is isomorphic to magnitude homology , and the second page is isomorphic to our homology . As an application, we show that the diagonality of magnitude homology implies triviality of reduced path homology. We also show that for and if any edges of an undirected graph is contained in a cycle of length .
arXiv commentversion 3 (refined some proofs, added some figures, and fixed some typos. To appear in Bulletin of the London Mathematical Society)