# Generic Identifiability of Linear Structural Equation Models by Ancestor Decomposition

Source: [Generic Identifiability of Linear Structural Equation Models by Ancestor Decomposition](<https://www.sota2.com/research/paper/68fa7d3c1e209131cea92242>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T06:18:37.181Z

Authors: Mathias Drton, Luca Weihs

Published: 2015-04-12T17:24:42.000Z

## 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).

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Causal Identification on Random Graphs (n=4) (exhaustive enumeration)](<https://www.sota2.com/research/sota/causal-identification-on-random-graphs-n-4-exhaustive-enumeration.md>): Causal Identification; Random Graphs (n=4) (exhaustive enumeration); Both Identified (%): 288.

- [Causal Identification on Random Graphs n=5 (exhaustive enumeration)](<https://www.sota2.com/research/sota/causal-identification-on-random-graphs-n-5-exhaustive-enumeration.md>): Causal Identification; Random Graphs n=5 (exhaustive enumeration); Count (Both Identified): 108368.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1504.02992>)

[PDF](<https://arxiv.org/pdf/1504.02992.pdf>)
