---
title: DAG-Wishart Prior for Gaussian DAG Models
url: https://www.emergentmind.com/topics/dag-wishart-prior
type: topic
---

# DAG-Wishart Prior for Gaussian DAG Models

The DAG-Wishart prior is a class of conjugate priors for the covariance and precision matrices of Gaussian graphical models Markov with respect to arbitrary directed acyclic graphs (DAGs). It provides a unifying, scalable, and flexible framework for Bayesian inference, model selection, and covariance estimation in Gaussian DAG models. By enabling a multi-parameter, vertex-specific formulation on the Cholesky factorization, the DAG-Wishart prior generalizes and extends earlier graphical Wishart constructions—especially to non-decomposable and high-dimensional settings.

## 1. Definition and Cholesky Parameterization

The DAG-Wishart prior arises from parameterizing the precision matrix $\Sigma^{-1}$ of a $p$-dimensional Gaussian variable as
\[
\Sigma^{-1} = L D^{-1} L^\top
\]
where $L$ is a lower-triangular matrix with unit diagonal ($l_{ii} = 1$) and off-diagonal entries $l_{ij}$ ($i > j$) set to zero whenever $i \notin pa(j)$, with $pa(j)$ denoting the parent set of node $j$ under the DAG. $D = \operatorname{diag}(d_{11}, \ldots, d_{pp})$ is a positive diagonal matrix.

The DAG-Wishart prior $\pi_{U,\alpha}^{\Theta_D}(D, L)$ on the "Cholesky space" $\Theta_D = \{(D, L) : D > 0, L \in \mathcal{L}_D\}$ is given by
\[
\pi_{U,\alpha}^{\Theta_D}(D, L) \propto \exp\left\{-\frac{1}{2} \mathrm{tr}(L D^{-1} L^\top U)\right\} \prod_{i=1}^p d_{ii}^{-\alpha_i/2}
\]
with $U$ a positive-definite "scale" matrix and $\alpha = (\alpha_1,\ldots,\alpha_p)$ a vector of shape parameters. The normalizing constant $z_D(U,\alpha)$ has a closed form, provided that for each $i$, $\alpha_i > |pa(i)|+2$ [1109.4371].

By explicit change-of-variables and mapping with the appropriate Jacobians, this density induces corresponding priors on the spaces of incomplete precision matrices $R_D$ and incomplete covariance matrices $S_D$, retaining the free parameters dictated by the DAG.

## 2. Generalization Beyond Decomposable Graphs

Earlier conjugate priors for Gaussian graphical models—such as the hyper inverse Wishart for undirected decomposable graphs [Dawid-Lauritzen, 1993], and the Letac-Massam multi-parameter Wishart for decomposable structures—either lacked vertex-specific flexibility or were not extensible to non-decomposable graphs. Previous DAG-based Wisharts (e.g., Geiger-Heckerman) often allowed only for a single shape parameter.

The DAG-Wishart prior fundamentally extends this landscape:
- It is defined for arbitrary DAGs, not just those corresponding to decomposable graphs.
- Each node can have its own shape parameter $\alpha_i$.
- The explicit Cholesky formulation allows correct imposition of the conditional independence relations, regardless of decomposability.
- The normalizing constant $z_D(U,\alpha)$ is available in closed form and does not require computational completion schemes [1109.4371, 1408.0788].

This approach leads to a dramatic increase in the flexibility and practical applicability of Bayesian inference on DAG models, opening up a broader class of model structures and shrinkage regimes [1408.0788].

## 3. Hyper Markov Properties and Conjugacy

A defining feature of the DAG-Wishart prior is its strong hyper Markov property. Under this prior, the parameter blocks $(d_{ii}, L_{pa(i)})$ for $i=1,\ldots,p$ are mutually independent:
\[
d_{ii} \sim \mathrm{InvGamma}\left(\frac{\alpha_i}{2} - \frac{|pa(i)|}{2} - 1, \frac{1}{2} U_{ii|pa(i)}\right)
\]
\[
L_{pa(i)} \mid d_{ii} \sim \mathcal{N}_{|pa(i)|}\left(-U_{pa(i)}^{-1} U_{pa(i),i}, \ d_{ii} U_{pa(i)}^{-1} \right)
\]
This strong separation means that the prior respects, and enforces, the Markov properties encoded in the DAG—a property critical for efficient computation and tractable marginal likelihoods [1109.4371].

A major implication is posterior conjugacy: given $n$ independent observations from $N_p(0, \Sigma)$, the posterior is again a DAG-Wishart with updated hyperparameters $(U+nS,\ \alpha + n)$, where $S$ is the empirical covariance.

Explicit conditional independence also ensures that marginal likelihoods, posterior moments, and other key Bayesian integrals remain tractable regardless of problem dimension.

## 4. Bayesian Model Selection Methodology

The DAG-Wishart prior enables a scalable, closed-form Bayesian model selection procedure over the space of DAG-Markov models with a given vertex ordering. The closed-form marginal likelihood is
\[
p(X \mid D) = \int f(X \mid \Sigma) \pi_{U,\alpha}(\Sigma)\; d\Sigma
\]
which, due to conjugacy and hyper Markov properties, admits efficient computation.

The paper proposes the DAG-W algorithm, which includes:
- Generation of candidate DAGs via a Lasso–DAG regularization path.
- Exploration of the local neighborhood (graphs that differ by a single edge).
- Stochastic shotgun search using annealed log–posterior scores.
- Selection of the highest-scoring graph.

Empirical evaluation confirms that this strategy scales to high dimensions ($p$ up to 2000), providing reliable graph estimation and covariance inference [1109.4371].

## 5. Numerical and Empirical Results

Extensive simulation and real data studies highlight key advantages:
- In high-dimensional settings ($p=50$ to $2000$, edge sparsity $\sim 0.01$), DAG-Wishart–based Bayesian model selection outperforms Lasso–DAG in sensitivity without compromising specificity.
- Compared to maximum likelihood estimators, posterior mean and MAP estimators under the DAG-Wishart prior yield reduced error (by losses and Stein’s risk), with the improvement most pronounced in small sample regimes.
- Real data (e.g., protein signaling networks, call center data) analysis reveals that the method recovers known structure and discovers additional interpretable edges while lowering prediction error.
- Performance tables demonstrate scalability and adaptability across a spectrum of problem sizes and sparsity levels [1109.4371].

## 6. Theoretical Justification and Connections

Later work established that, under mild regularity and modularity assumptions, the normal-Wishart (DAG-Wishart) prior is the unique conjugate prior for Gaussian DAG models that satisfies complete model equivalence and global parameter independence [1301.6697, 2105.03248]. This is rooted in a block-independence property (Schur complement independence) of the Wishart distribution:
\[
f(W) \ \text{is Wishart} \iff W_{11} - W_{12} W_{22}^{-1} W_{21} \perp \{ W_{12}, W_{22} \}
\]
for every possible block decomposition. This theoretical underpinning ensures parameter and likelihood modularity, consistency of model scoring across Markov equivalent structures, and tractable marginal likelihood factorization [1301.6697, 2105.03248].

These results also justify a methodology in which, given a prior for one complete model, priors for all DAG models can be derived via coordinate transformation, greatly reducing the burden of prior specification in large graphical model spaces.

## 7. Applications and Implications

The DAG-Wishart prior framework has broad applicability:
- **Genomics and systems biology**: Flexible, vertex-specific shape parameters enable the modeling of heterogeneous network structures (e.g., gene or protein regulatory networks).
- **Finance and signal processing**: Efficient high-dimensional covariance estimation with sparsity constraints, essential for portfolio, risk, and filter models.
- **Causal inference and time series**: Enables explicit Bayesian updating and model selection in temporal or causal network structures, benefitting applications ranging from time-ordered Bayesian networks to dynamic graphical models.
- **Algorithmic and computational advances**: The strong hyper Markov and conjugacy properties facilitate Markov chain sampling schemes, scalable structure search algorithms, and explicit treatment of both decomposable and non-decomposable graphs.

Potential future developments include integration with non-Gaussian or mixed variable models, incorporation into scalable MCMC and variational frameworks, and refined strategies for prior elicitation and regularization in high-dimensional regimes [1109.4371, 1301.6697, 1408.0788].

---

Overall, the DAG-Wishart prior introduces a theoretically grounded, computationally tractable, and empirically robust methodology for Bayesian analysis of Gaussian DAG models. By combining multi-parameter flexibility, conjugacy, and strong hyper Markov properties, it enables explicit, scalable inference and structure learning across a diverse array of complex networked data contexts.

Source: https://www.emergentmind.com/topics/dag-wishart-prior