PreprintCC0arXiv
The discrete homotopy hypothesis for directed graphs
Abstract
We develop a homotopy theory of directed graphs based on cubical homotopy groups, also known as A-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups yields an ∞-category, denoted by sf DGra∞. We prove that sf DGra∞ is equivalent to the ∞-category of spaces, establishing a directed version of the discrete homotopy hypothesis of Carranza and Kapulkin.
Related
- Discrete homotopy of graphs and k-parabolic subspace arrangements
- The homotopy types of directed path and trace spaces
- Discrete homotopy groups of cubical sets
- On Lewis's homotopy in distance-regular graphs
- The Homotopy Types of the Independence and Perfect Matching Complexes of Möbius and Circular Ladder Graphs
BibTeX
@misc{eldridge2026discrete,
title = {{The discrete homotopy hypothesis for directed graphs}},
author = {Briony Eldridge and Sergei O. Ivanov and Xiaomeng Xu and Shing-Tung Yau and Mengmeng Zhang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2605.04959},
eprint = {2605.04959},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.04959},
note = {CC0},
}
RIS
TY - UNPB
TI - The discrete homotopy hypothesis for directed graphs
AU - Briony Eldridge
AU - Sergei O. Ivanov
AU - Xiaomeng Xu
AU - Shing-Tung Yau
AU - Mengmeng Zhang
PY - 2026
DA - 2026/09/10
PB - arXiv
DO - 10.48550/arxiv.2605.04959
UR - https://arxiv.org/abs/2605.04959
AB - We develop a homotopy theory of directed graphs based on cubical homotopy groups, also known as A-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups yields an ∞-category, denoted by sf DGra_∞. We prove that sf DGra_∞ is equivalent to the ∞-category of spaces, establishing a directed version of the discrete homotopy hypothesis of Carranza and Kapulkin.
ER -