Graph motifs are small connected subgraphs with a well-defined structure. These functions search a graph for various motifs.
count_motifs(graph, size = 3, cut.prob = rep(0, size))
- Graph object, the input graph.
- The size of the motif, currently 3 and 4 are supported only.
- 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
sizeargument). By default no cuts are made.
count_motifs calculates the total number of motifs of a given
size in graph.
count_motifsreturns a numeric scalar.
g <- barabasi.game(100) motifs(g, 3) count_motifs(g, 3) sample_motifs(g, 3)
Looks like there are no examples yet.