Minimal Trails in Restricted DAGs
Combinatorics
2025-10-03 v1
Abstract
In this paper, the properties of minimal trails in a directed acyclic graph that is restricted not to contain an active cycle are studied. We are motivated by an application of the results in the copula-based Bayesian Network model developed recently. We propose a partial order on the set of trails activated by a certain subset of nodes, and show that every minimal trail, according to such an order, has a simple structure.
Cite
@article{arxiv.2510.02113,
title = {Minimal Trails in Restricted DAGs},
author = {Alexis Derumigny and Niels Horsman and Dorota Kurowicka},
journal= {arXiv preprint arXiv:2510.02113},
year = {2025}
}
Comments
28 pages, 18 figures