Generic identifiability of linear structural equation models by ancestor decomposition

From MaRDI portal
Publication:2835308

DOI10.1111/SJOS.12227zbMATH Open1373.62250arXiv1504.02992OpenAlexW2201599271WikidataQ57566364 ScholiaQ57566364MaRDI QIDQ2835308FDOQ2835308


Authors: Mathias Drton, Luca Weihs Edit this on Wikidata


Publication date: 2 December 2016

Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)

Abstract: Linear structural equation models, which relate random variables via linear interdependencies and Gaussian noise, are a popular tool for modeling multivariate joint distributions. These models correspond to mixed graphs that include both directed and bidirected edges representing the linear relationships and correlations between noise terms, respectively. A question of interest for these models is that of parameter identifiability, whether or not it is possible to recover edge coefficients from the joint covariance matrix of the random variables. For the problem of determining generic parameter identifiability, we present an algorithm that extends an algorithm from prior work by Foygel, Draisma, and Drton (2012). The main idea underlying our new algorithm is the use of ancestral subsets of vertices in the graph in application of a decomposition idea of Tian (2005).


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




Recommendations




Cites Work


Cited In (11)

Uses Software





This page was built for publication: Generic identifiability of linear structural equation models by ancestor decomposition

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