essentialGraph              package:ggm              R Documentation

_E_s_s_e_n_t_i_a_l _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     Find the essential graph from a given directed acyclic graph.

_U_s_a_g_e:

     essentialGraph(dagx)

_A_r_g_u_m_e_n_t_s:

    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.

_D_e_t_a_i_l_s:

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

_V_a_l_u_e:

     returns the adjacency matrix of the essential graph.

_A_u_t_h_o_r(_s):

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

_R_e_f_e_r_e_n_c_e_s:

     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.

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

_S_e_e _A_l_s_o:

     'DAG', 'InducedGraphs'

_E_x_a_m_p_l_e_s:

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

