grecip                  package:sna                  R Documentation

_C_o_m_p_u_t_e _t_h_e _R_e_c_i_p_r_o_c_i_t_y _o_f _a_n _I_n_p_u_t _G_r_a_p_h _o_r _G_r_a_p_h _S_t_a_c_k

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

     'grecip' calculates the dyadic reciprocity of the elements of
     'dat' selected by 'g'.

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

     grecip(dat, g = NULL, measure = c("dyadic", "dyadic.nonnull",
         "edgewise"))

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

     dat: one or more input graphs. 

       g: a vector indicating which graphs to evaluate (optional). 

 measure: one of '"dyadic"' (default), '"dyadic.nonnull"' or
          '"edgewise"'. 

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

     The dyadic reciprocity of a graph is the proportion of dyads which
     are symmetric; this is computed and returned by 'grecip' for the
     graphs indicated.  ('dyadic.nonnull' returns the ratio of mutuals
     to non-null dyads.)  Note that the dyadic reciprocity is distinct
     from the _edgewise_ or _tie reciprocity_, which is the proportion
     of _edges_ which are reciprocated.  This latter form may be
     obtained by setting 'measure="edgewise"'.

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

     The graph reciprocity value(s)

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

     Carter T. Butts buttsc@uci.edu

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

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

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

     'mutuality', 'symmetrize'

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

     #Calculate the dyadic reciprocity scores for some random graphs
     grecip(rgraph(10,5))

