A Geometric Principle for Path Selection in Directed Acyclic Graphs
Abstract
There are many types of path between nodes of a Directed acyclic graph (DAG), including the shortest and longest paths. Here, we ask whether the choice of path used in any analysis reflects the geometry of the latent space in which the DAG is embedded. To do this we define L_p-cube spacetimes, a family of continuous ordered spaces in which a single parameter p determines whether the ordered distance satisfies the ordered triangle identity when p>1, or the reverse ordered triangle identity when 0<p<1 or p<0, both of which are rarely studied. The forward connection kernel in the p<0 case has infinite hyper-volume, yet it is a well defined model. We then construct random geometric DAGs embedded in our L_p-cube spacetime and study their geometry. For p>1, where the ordered triangle identity holds, the shortest paths provide the closest approximation to the continuum ordered geodesic while for 0<p<1 and p<0, where the reverse ordered triangle identity holds, this role is instead taken by the longest weighted path. We also test the robustness of this relationship in a geometric citation model in which the random geometric DAG is supplemented by a preferential-attachment-type mechanism allowing connections beyond the strict geometric cut-off. The same broad correspondence between latent geometry and ordered geodesic path type is recovered. Our results show that the preference for shortest or longest paths in a DAG is closely connected to the geometry assumed for its latent space, and suggest that path structure can provide information about latent geometry, even when that geometry is not directly observed.
Related
- 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
- Walk/Zeta correspondence for quantum walks on path graphs: a pre-geometric structure implied by a generalized reflection principle
BibTeX
@misc{almuhanna2026geometric,
title = {{A Geometric Principle for Path Selection in Directed Acyclic Graphs}},
author = {Haya AlMuhanna and Tim S. Evans},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.27025},
eprint = {2610.27025},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.27025},
}
RIS
TY - UNPB
TI - A Geometric Principle for Path Selection in Directed Acyclic Graphs
AU - Haya AlMuhanna
AU - Tim S. Evans
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.27025
UR - https://arxiv.org/abs/2610.27025
AB - There are many types of path between nodes of a Directed acyclic graph (DAG), including the shortest and longest paths. Here, we ask whether the choice of path used in any analysis reflects the geometry of the latent space in which the DAG is embedded. To do this we define L_p-cube spacetimes, a family of continuous ordered spaces in which a single parameter p determines whether the ordered distance satisfies the ordered triangle identity when p>1, or the reverse ordered triangle identity when 0<p<1 or p<0, both of which are rarely studied. The forward connection kernel in the p<0 case has infinite hyper-volume, yet it is a well defined model. We then construct random geometric DAGs embedded in our L_p-cube spacetime and study their geometry. For p>1, where the ordered triangle identity holds, the shortest paths provide the closest approximation to the continuum ordered geodesic while for 0<p<1 and p<0, where the reverse ordered triangle identity holds, this role is instead taken by the longest weighted path. We also test the robustness of this relationship in a geometric citation model in which the random geometric DAG is supplemented by a preferential-attachment-type mechanism allowing connections beyond the strict geometric cut-off. The same broad correspondence between latent geometry and ordered geodesic path type is recovered. Our results show that the preference for shortest or longest paths in a DAG is closely connected to the geometry assumed for its latent space, and suggest that path structure can provide information about latent geometry, even when that geometry is not directly observed.
ER -