count_motifs: Graph motifs

In igraph: Network Analysis and Visualization

Graph motifs

Description

Graph motifs are small connected induced subgraphs with a well-defined structure. These functions search a graph for various motifs.

Usage

count_motifs(graph, size = 3, cut.prob = rep(0, size))

Arguments

graph	Graph object, the input graph.
size	The size of the motif.
cut.prob	Numeric vector giving the probabilities that the search graph is cut at a certain level. Its length should be the same as the size of the motif (the size argument). By default no cuts are made.

Details

count_motifs() calculates the total number of motifs of a given size in graph.

Value

count_motifs() returns a numeric scalar.

See Also

isomorphism_class()

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

Examples

g <- sample_pa(100)
motifs(g, 3)
count_motifs(g, 3)
sample_motifs(g, 3)

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