Probability distributions with summary graph structure

From MaRDI portal
Publication:638759

DOI10.3150/10-BEJ309zbMATH Open1245.62062arXiv1003.3259MaRDI QIDQ638759FDOQ638759


Authors: Nanny Wermuth Edit this on Wikidata


Publication date: 14 September 2011

Published in: Bernoulli (Search for Journal in Brave)

Abstract: A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of edges that couple node pairs. One important class contains regression graphs. Regression graphs are a type of so-called chain graph and describe stepwise processes, in which at each step single or joint responses are generated given the relevant explanatory variables in their past. For joint densities that result after possible marginalising or conditioning, we introduce summary graphs. These graphs reflect the independence structure implied by the generating process for the reduced set of variables and they preserve the implied independences after additional marginalising and conditioning. They can identify generating dependences that remain unchanged and alert to possibly severe distortions due to direct and indirect confounding. Operators for matrix representations of graphs are used to derive these properties of summary graphs and to translate them into special types of paths in graphs.


Full work available at URL: https://arxiv.org/abs/1003.3259




Recommendations




Cites Work


Cited In (27)

Uses Software





This page was built for publication: Probability distributions with summary graph structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638759)