pith. sign in

arxiv: 1304.2736 · v1 · pith:VTRWI44Lnew · submitted 2013-03-27 · 💻 cs.AI

The Recovery of Causal Poly-Trees from Statistical Data

classification 💻 cs.AI
keywords causalmethodvariablesdistributionsmeasuredpoly-treesadditionarise
0
0 comments X
read the original abstract

Poly-trees are singly connected causal networks in which variables may arise from multiple causes. This paper develops a method of recovering ply-trees from empirically measured probability distributions of pairs of variables. The method guarantees that, if the measured distributions are generated by a causal process structured as a ply-tree then the topological structure of such tree can be recovered precisely and, in addition, the causal directionality of the branches can be determined up to the maximum extent possible. The method also pinpoints the minimum (if any) external semantics required to determine the causal relationships among the variables considered.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Structure Learning for Directed Trees with Zero-Inflated Compositional Nodes

    stat.ME 2026-05 unverdicted novelty 7.0

    A new directed tree structure learning framework for zero-inflated compositional nodes uses KL divergence scoring and column-stochastic transition matrices for conditional expectations, with proven consistency and fin...