Restrictions of PCBNs for integration-free computations

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Derumigny, Alexis, Horsman, Niels, Kurowicka, Dorota
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918154043654144
author Derumigny, Alexis
Horsman, Niels
Kurowicka, Dorota
author_facet Derumigny, Alexis
Horsman, Niels
Kurowicka, Dorota
contents The pair-copula Bayesian Networks (PCBN) are graphical models composed of a directed acyclic graph (DAG) that represents (conditional) independence in a joint distribution. The nodes of the DAG are associated with marginal densities, and arcs are assigned with bivariate (conditional) copulas following a prescribed collection of parental orders. The choice of marginal densities and copulas is unconstrained. However, the simulation and inference of a PCBN model may necessitate possibly high-dimensional integration. We present the full characterization of DAGs that do not require any integration for density evaluation or simulations. Furthermore, we propose an algorithm that can find all possible parental orders that do not lead to (expensive) integration. Finally, we show the asymptotic normality of estimators of PCBN models using stepwise estimating equations. Such estimators can be computed effectively if the PCBN does not require integration. A simulation study shows the good finite-sample properties of our estimators.
format Preprint
id arxiv_https___arxiv_org_abs_2510_03518
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Restrictions of PCBNs for integration-free computations
Derumigny, Alexis
Horsman, Niels
Kurowicka, Dorota
Methodology
Combinatorics
Statistics Theory
62H22, 62H05 (Primary), 62H12 (Secondary)
The pair-copula Bayesian Networks (PCBN) are graphical models composed of a directed acyclic graph (DAG) that represents (conditional) independence in a joint distribution. The nodes of the DAG are associated with marginal densities, and arcs are assigned with bivariate (conditional) copulas following a prescribed collection of parental orders. The choice of marginal densities and copulas is unconstrained. However, the simulation and inference of a PCBN model may necessitate possibly high-dimensional integration. We present the full characterization of DAGs that do not require any integration for density evaluation or simulations. Furthermore, we propose an algorithm that can find all possible parental orders that do not lead to (expensive) integration. Finally, we show the asymptotic normality of estimators of PCBN models using stepwise estimating equations. Such estimators can be computed effectively if the PCBN does not require integration. A simulation study shows the good finite-sample properties of our estimators.
title Restrictions of PCBNs for integration-free computations
topic Methodology
Combinatorics
Statistics Theory
62H22, 62H05 (Primary), 62H12 (Secondary)
url https://arxiv.org/abs/2510.03518