dyad.census              package:igraph              R Documentation

_D_y_a_d _c_e_n_s_u_s _o_f _a _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     Classify dyads in a directed graphs. The relationship between each
     pair of vertices is measured. It can be in three states: mutual,
     asymmetric or non-existent.

_U_s_a_g_e:

     dyad.census(graph)

_A_r_g_u_m_e_n_t_s:

   graph: The input graph. A warning is given if it is not directed.

_V_a_l_u_e:

     A named numeric vector with three elements: 

     mut: The number of pairs with mutual connections.

    asym: The number of pairs with non-mutual connections.

    null: The number of pairs with no connection between them.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_R_e_f_e_r_e_n_c_e_s:

     Holland, P.W. and Leinhardt, S. A Method for Detecting Structure
     in Sociometric Data. _American Journal of Sociology_, 76, 492-513.
     1970.

     Wasserman, S., and Faust, K. _Social Network Analysis: Methods and
     Applications._ Cambridge: Cambridge University Press. 1994.

_S_e_e _A_l_s_o:

     'triad.census' for the same classification, but with triples.

_E_x_a_m_p_l_e_s:

     g <- ba.game(100)
     dyad.census(g)

