arXiv · 2607.23357
Magnitude homology and Euler characteristics of directed acyclic graphs
Abstract
We develop a scalable approach to computing the magnitude homology Euler characteristic for directed acyclic graphs based on decategorification. Along with motivating mathematical results and some simple controlled examples, we deploy the Euler characteristic in a proof of concept application to the dynamic analysis of multilayer perceptrons, recovering class-discriminative structure while holding simpler subgraph properties fixed.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Steve Huntsman. 2026-07-25. Magnitude homology and Euler characteristics of directed acyclic graphs. https://arxiv.org/abs/2607.23357
Cite the original work for its findings. Save a collection to share your selection of sources.