numbermixed               package:deal               R Documentation

_T_h_e _n_u_m_b_e_r _o_f _p_o_s_s_i_b_l_e _n_e_t_w_o_r_k_s

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

     Calculates the number of different directed acyclic graphs for a
     set of discrete and continuous nodes.

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

     numbermixed(nd,nc)

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

      nd: an integer, which gives the number of discrete nodes.

      nc: an integer, which gives the number of continuous nodes.

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

     No arrows are allowed from continuous nodes to discrete nodes.
     Cycles are not allowed. The number of networks is given by
     Bttcher (2003), using the result in Robinson (1977).

     When nd+nc>15, the procedure is quite slow.

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

     A numeric containing the number of directed acyclic graphs with
     the given node configuration.

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

     Susanne Gammelgaard Bttcher alma@math.aau.dk, 
      Claus Dethlefsen cld@rn.dk.

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

     Bttcher, S.G. (2003). Learning Conditional Gaussian Networks.
     <URL: http://www.math.aau.dk/~alma>. Aalborg University, 2003.

     Robinson, R.W. (1977). Counting unlabeled acyclic digraphs, {\em
     Lecture Notes in Mathematics}, 622: Combinatorial Mathematics.

     Further information about *deal* can be found at:
      <URL: http://www.math.aau.dk/~dethlef/novo/deal>.

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

     numbermixed(2,2)
     ## Not run: numbermixed(5,10)

