Morse-Maxwell Theory for Directed Acyclic Graph
Abstract
The Maxwell graph of a directed acyclic graph is obtained from its iterated basin and hill boundaries. The unweighted counts of extrema at these levels need not satisfy Morse inequalities. We assign multiplicities by the reduced homology of lower and upper order links and retain the vertices with nonzero local homology. The resulting graph preserves both boundary hierarchies, the local groups, and the homology of all sublevel and superlevel order complexes. Its descending and ascending Morse numbers satisfy the weak and strong Morse inequalities over any field. We also construct a Morse chain complex and compute the local groups in several examples. Finally, we consider homology on the original Maxwell graph and prove analogous inequalities for path homology using relative local groups.
Related
- Copula Adapted Directed Acyclic Graph for Cluster Representation of Biomedical Data
- Causal Discovery beyond Conditional Independence: Identifiability, Algorithms, and Statistical Inference for Directed Acyclic and Cyclic Graphs
- Semiparametric Bayesian structure learning of nonparanormal directed acyclic graphs with local--global shrinkage
- Data-Driven Learning of Directed Acyclic Graphs in Gaussian Linear Structural Equation Models with Latent Variables
- Nonparanormal Bayesian Learning of Directed Acyclic Graphs under Gamma and Inverse-Gamma Innovation Priors: Closed-Form Scores and Informed Sampling
BibTeX
@misc{musin2026morsemaxwell,
title = {{Morse-Maxwell Theory for Directed Acyclic Graph}},
author = {Oleg R. Musin},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36372},
eprint = {2610.36372},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36372},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Morse-Maxwell Theory for Directed Acyclic Graph
AU - Oleg R. Musin
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2610.36372
UR - https://arxiv.org/abs/2610.36372
AB - The Maxwell graph of a directed acyclic graph is obtained from its iterated basin and hill boundaries. The unweighted counts of extrema at these levels need not satisfy Morse inequalities. We assign multiplicities by the reduced homology of lower and upper order links and retain the vertices with nonzero local homology. The resulting graph preserves both boundary hierarchies, the local groups, and the homology of all sublevel and superlevel order complexes. Its descending and ascending Morse numbers satisfy the weak and strong Morse inequalities over any field. We also construct a Morse chain complex and compute the local groups in several examples. Finally, we consider homology on the original Maxwell graph and prove analogous inequalities for path homology using relative local groups.
ER -