basiSet                 package:ggm                 R Documentation

_B_a_s_i_s _s_e_t _o_f _a _D_A_G

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

     Finds a basis set for the conditional independencies implied by a
     directed acyclic graph, that is a minimal set of independencies
     that imply all the other ones.

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

     basiSet(amat)

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

    amat: a square matrix with dimnames representing the adjacency
          matrix of a DAG.

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

     Given a DAG and a pair of non adjacent nodes (i,j) such that j has
     higher causal order than i, the set of independency statements i
     independent of j given the union of the parents of both i and j is
     a basis set (see Shipley, 2000). This basis set has the property
     to lead to independent test statistics.

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

     a list of vectors representing several conditional independence
     statements. Each vector contains the names of two non adjacent
     nodes followed by the names of nodes in the conditioning set
     (which may be empty).

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

     Giovanni M. Marchetti

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

     Shipley, B. (2000). A new inferential test for path models based
     on directed acyclic graphs. _Structural Equation Modeling_, 7(2),
     206-218.

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

     'shipley.test', 'dSep', 'DAG'

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

     ## See Shipley (2000), Figure 2, p. 213
     A <- DAG(x5~ x3+x4, x3~ x2, x4~x2, x2~ x1)
     basiSet(A)

