sna (version 0.3)

gtrans: Compute the Transitivity of an Input Graph or Graph Stack

Description

gtrans returns the fraction of triads which are transitive, i.e., for which $A^2=A$. Triads involving missing values are omitted from the analysis.

Usage

gtrans(dat, g=NULL, diag=FALSE, mode="digraph")

Arguments

dat

A graph or graph stack

g

A vector indicating the graphs which are to be analyzed; by default, all graphs are analyzed

diag

A boolean indicating whether or not diagonal entries (loops) are to be taken as valid data

mode

``digraph'' if directed triads are sought, or else ``graph''

Value

• A vector of transitivity scores

References

Holland, P.W., and Leinhardt, S. (1972). ``Some Evidence on the Transitivity of Positive Interpersonal Sentiment.'' American Journal of Sociology, 72, 1205-1209.

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

See Also

cugtest

Examples

#Draw some random graphs
g<-rgraph(5,10)

#Find transitivity scores
gtrans(g)