The maximum likelihood threshold of a path diagram
For a random vector $X=(X_1, \ldots , X_p)$ a linear structural equation model incoporates linear constraints of the form: \[ X_i = \lambda_{0i} + \sum_{j \ne i} \lambda_{ij}X_j + \varepsilon_i, \quad i=1, \dots, p, \] where $\varepsilon$ is a random error vector, assumed to be normal with zero mean and variance-covariance matrix $\Omega=(\omega_{ij})$, and the $\lambda$s are real parameters. The structure of the model is summarized in a mixed graph $(V,D,B)$ where: $V=\{1, \dots, p\}$ represents the set of variables; $D \subset V \times V$ is a directed graph that captures the structure of the $\lambda$ coefficients ($i \rightarrow j \notin D$ if and only if $\lambda_{ij} = 0$); and $B$ is a set containing $2$-element subsets (bidirected edges) of $V$ describing the correlation structure of $\varepsilon$ ($\omega_{ij} = 0$ when $i \ne j$ and $i \leftrightarrow j \notin B$). \par In this paper, the authors compute the maximum likelihood threshold (mlt) of such models. The mlt is the minimum sample size $N$ such that the likelihood function is bounded a.s. for any sample size $n \ge N$. The resulting formula has a simple expression, since it is enough to take all the connected components $C_1, \dots, C_l$ of the bidirected part of the mixed graph, and to compute, for each $C_j$, the cardinality of the union of $C_j$ with the parents of its elements.
- The maximum likelihood threshold of a graph
- Geometry of maximum likelihood estimation in Gaussian graphical models
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- On the Validity of the Markov Interpretation of Path Diagrams of Gaussian Structural Equations Systems with Correlated Errors
- Maximum likelihood threshold and generic completion rank of graphs
- Max-linear models on directed acyclic graphs
- Computation of maximum likelihood estimates in cyclic structural equation models
- Existence and uniqueness of the Kronecker covariance MLE
- Sharp lower and upper bounds for the Gaussian rank of a graph
- The maximum likelihood threshold of a graph
- Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
- Symmetries in directed Gaussian graphical models
- Maximum likelihood thresholds via graph rigidity
- A bridge between invariant theory and maximum likelihood estimation
- Complete collineations for maximum likelihood estimation
- Maximum likelihood thresholds of generic linear concentration models
This page was built for publication: The maximum likelihood threshold of a path diagram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2414096)
