grecip {sna}R Documentation

Compute the Reciprocity of an Input Graph or Graph Stack

Description

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

Usage

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

Arguments

dat

one or more input graphs.

g

a vector indicating which graphs to evaluate (optional).

measure

one of "dyadic" (default), "dyadic.nonnull", "edgewise", or "edgewise.lrr".

Details

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". Setting measure="edgewise.lrr" returns the log of the ratio of the edgewise reciprocity to the density; this is measure (called r_4 by Butts (2008)) can be interpreted as the relative log-odds of an edge given a reciprocation, versus the baseline probability of an edge.

Value

The graph reciprocity value(s)

Author(s)

Carter T. Butts buttsc@uci.edu

References

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

Butts, C.T. (2008). “Social Networks: A Methodological Introduction.” Asian Journal of Social Psychology, 11(1), 13-41.

See Also

mutuality, symmetrize

Examples

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

[Package sna version 2.2-0 Index]