reciprocity              package:igraph              R Documentation

_R_e_c_i_p_r_o_c_i_t_y _o_f _g_r_a_p_h_s

_D_e_s_c_r_i_p_t_i_o_n:

     Calculates the reciprocity of a directed graph.

_U_s_a_g_e:

     reciprocity(graph, ignore.loops = TRUE) 

_A_r_g_u_m_e_n_t_s:

   graph: The graph object.

ignore.loops: Logical constant, whether to ignore loop edges.

_D_e_t_a_i_l_s:

     A vertex pair (A, B) is said to be reciprocal if there are edges
     between them in both directions. The reciprocity of a directed
     graph is the proportion of all possible (A, B) pairs which are
     reciprocal, provided there is at least one edge between A and B.
     The reciprocity of an empty graph is undefined (results in an
     error code). Undirected graphs always have a reciprocity of 1.0
     unless they are empty.

_V_a_l_u_e:

     A numeric constaint between zero and one.

_A_u_t_h_o_r(_s):

     Tamas Nepusz ntamas@rmki.kfki.hu and Gabor Csardi
     csardi@rmki.kfki.hu

_E_x_a_m_p_l_e_s:

     g <- random.graph.game(20, 5/20, directed=TRUE)
     reciprocity(g)

