dyad.census {igraph} | R Documentation

## 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.

### Author(s)

Gabor Csardi csardi@rmki.kfki.hu

### 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.

### Examples

    g <- ba.game(100)
    dyad.census(g)

[Package igraph version 0.5.2 Index]