Skip to contents

Graph motifs

Source: R/motifs.R
count_motifs.Rd

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 = NULL)

Arguments

graph

Graph object, the input graph.

size

The size of the motif.

...

These dots are for future extensions and must be empty.

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). If NULL, the default, no cuts are made.

Value

count_motifs() returns a numeric scalar.

Details

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

motifs_randesu_no()

See also

isomorphism_class()

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

Examples

g <- sample_pa(100)
motifs(g, 3)
#>  [1]  NA  NA 366  NA  78   0   0   0   0   0   0   0   0   0   0   0
count_motifs(g, 3)
#> [1] 444
sample_motifs(g, 3)
#> [1] 2950