0th

Percentile

Dyad census of a graph

Classify dyads in a directed graphs. The relationship between each pair of vertices is measured. It can be in three states: mutual, asymmetric or non-existent.

Keywords
graphs
Usage
dyad.census(graph)
Arguments
graph
The input graph. A warning is given if it is not directed.
Value

• A named numeric vector with three elements:
• mutThe number of pairs with mutual connections.
• asymThe number of pairs with non-mutual connections.
• nullThe number of pairs with no connection between them.

References

Holland, P.W. and Leinhardt, S. A Method for Detecting Structure in Sociometric Data. American Journal of Sociology, 76, 492--513. 1970.

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

triad.census for the same classification, but with triples.
g <- ba.game(100)
dyad.census(g)