triad_census: Triad Census

In cograph: Analysis and Visualization of Complex Networks

Triad Census

Description

Count the 16 types of triads in a directed network using MAN notation.

Usage

triad_census(x)

Arguments

x	A matrix, igraph object, or cograph_network

Details

Triad census is defined only for directed networks. The input is always treated as directed.

MAN notation describes triads by:

• M: number of Mutual (reciprocal) edges

• A: number of Asymmetric edges

• N: number of Null (absent) edges

The 16 triad types are: 003, 012, 102, 021D, 021U, 021C, 111D, 111U, 030T, 030C, 201, 120D, 120U, 120C, 210, 300

Value

Named vector of triad counts

See Also

motifs() for the unified API, motif_census()

Other motifs: extract_motifs(), extract_triads(), get_edge_list(), motif_census(), motifs(), plot.cograph_motif_analysis(), plot.cograph_motifs(), subgraphs()

Examples

mat <- matrix(sample(0:1, 100, replace = TRUE), 10, 10)
diag(mat) <- 0
triad_census(mat)

cograph documentation built on April 1, 2026, 1:07 a.m.