mutuality                package:sna                R Documentation

_F_i_n_d _t_h_e _M_u_t_u_a_l_i_t_y _o_f _a _G_r_a_p_h

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

     Returns the mutuality scores of the graphs indicated by `g' in
     `dat'.

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

     mutuality(dat, g=NULL)

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

     dat: A graph or graph stack 

       g: A vector indicating which elements of `dat' should be
          analyzed; by default, all graphs are included 

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

     The mutuality of a digraph G is defined as the number of complete
     dyads (i.e., i<->j) within G.  (Compare this to dyadic
     reciprocity, the fraction of dyads within G which are symmetric.) 
     Mutuality is commonly employed as a measure of reciprocal tendency
     within the p* literature; although mutuality can be very hard to
     interpret in practice, it is much better behaved than many
     alternative measures.

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

     One or more mutuality scores

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

     Carter T. Butts ctb@andrew.cmu.edu

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

     Moreno, J.L., and Jennings, H.H.  (1938).  ``Statistics of Social
     Configurations.''  Sociometry, 1, 342-374.

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

     `grecip'

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

     #Create some random graphs
     g<-rgraph(15,3)

     #Get mutuality and reciprocity scores
     mutuality(g)
     grecip(g)         #Compare with mutuality

