dyad_census: Dyad census of a graph

In igraph: Network Analysis and Visualization

Dyad census of a graph

Description

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.

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:

mut	The number of pairs with mutual connections.
asym	The number of pairs with non-mutual connections.
null	The number of pairs with no connection between them.

Related documentation in the C library

igraph_dyad_census().

Author(s)

Gabor Csardi [e-mail]

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.

See Also

triad_census() for the same classification, but with triples.

Other graph motifs: count_motifs(), motifs(), sample_motifs()

Examples

g <- sample_pa(100)
dyad_census(g)

igraph documentation built on Oct. 20, 2024, 1:06 a.m.