R: Essential graph

essentialGraph {ggm} | R Documentation

## Essential graph

### Description

Find the essential graph from a given directed acyclic graph.

### Usage

    essentialGraph(dagx)

### Arguments

`dagx` | a square binary matrix, the adjacency matrix of a directed acyclic graph. The names of rows and of the columns are the nodes of the DAG.

### Details

Converts a DAG into the Essential Graph. Is implemented by the algorithm by D.M.Chickering (1995).

### Value

returns the adjacency matrix of the essential graph.

### Author(s)

Giovanni M. Marchetti, translating a MATLAB function by Tomas Kocka, AAU

### References

Chickering, D.M. (1995). A transformational characterization of equivalent Bayesian network structures. Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, QU, 87-98. Morgan Kaufmann.

http://research.microsoft.com/~dmax/publications/uai95.pdf

### See Also

`DAG`, `InducedGraphs`

### Examples

    dag = DAG(U ~ Y+Z, Y~X, Z~X)
    essentialGraph(dag)

[Package ggm version 2.3 Index]