The path-missing and path-free complexes of a directed graph
Darij Grinberg, Lukas Katth\"an, Joel Brewster Lewis

TL;DR
This paper investigates two simplicial complexes derived from a directed graph related to vertices s and t, demonstrating they have simple homotopy types using discrete Morse theory.
Contribution
It introduces and analyzes the path-missing and path-free complexes, revealing their homotopy types are either contractible or sphere-like, using discrete Morse theory.
Findings
Both complexes are either contractible or homotopy equivalent to spheres.
The complexes have well-behaved homotopy types.
Discrete Morse theory is used to analyze their topological properties.
Abstract
We study two simplicial complexes arising from a directed graph with two chosen vertices and : the *path-free complex*, consisting of all subsets that contain no path from to , and the *path-missing complex*, its Alexander dual. Using discrete Morse theory, we prove that both complexes have well-behaved homotopy types -- either contractible or homotopy-equivalent to spheres.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Advanced Combinatorial Mathematics
