Graph motifs are small connected induced subgraphs with a well-defined structure. These functions search a graph for various motifs.
Arguments
- graph
Graph object, the input graph.
- size
The size of the motif, currently size 3 and 4 are supported in directed graphs and sizes 3-6 in undirected graphs.
- 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.- sample.size
The number of vertices to use as a starting point for finding motifs. Only used if the
sample
argument isNULL
.- sample
If not
NULL
then it specifies the vertices to use as a starting point for finding motifs.
Details
sample_motifs()
estimates the total number of motifs of a given
size in a graph based on a sample.
See also
Other graph motifs:
count_motifs()
,
dyad_census()
,
motifs()
Examples
g <- sample_pa(100)
motifs(g, 3)
#> [1] NA NA 576 NA 67 0 0 0 0 0 0 0 0 0 0 0
count_motifs(g, 3)
#> [1] 643
sample_motifs(g, 3)
#> [1] 0