# dyad_census

From igraph v1.0.1
by Gabor Csardi

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

The number of pairs with mutual connections.

The number of pairs with non-mutual connections.

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

##### See Also

`triad_census`

for the same classification, but with
triples.

##### Examples

```
# NOT RUN {
g <- sample_pa(100)
dyad_census(g)
# }
```

*Documentation reproduced from package igraph, version 1.0.1, License: GPL (>= 2)*

### Community examples

Looks like there are no examples yet.