graph.motifs(graph, size = 3, cut.prob = rep(0, size))
graph.motifs.no(graph, size = 3, cut.prob = rep(0, size))
graph.motifs.est(graph, size = 3, cut.prob = rep(0, size), sample.size =
vcount(graph)/10, sample = NULL)
size
argument). By default
no cuts are made.sample
argument is
NULL
.NULL
then it specifies the vertices to use
as a starting point for finding motifs.graph.motifs
returns a numeric vector. graph.motifs.no
and graph.motifs.est
return a numeric
constant.
graph.motifs
searches a graph for motifs of a given size and
returns a numeric vector containing the number of different
motifs. The order of the motifs is defined by their isomorphism class,
see graph.isoclass
. graph.motifs.no
calculates the total number of motifs of a
given size in graph.
graph.motifs.est
estimates the total number of motifs of a
given size in a graph based on a sample.
graph.isoclass
g <- barabasi.game(100)
graph.motifs(g, 3)
graph.motifs.no(g, 3)
graph.motifs.est(g, 3)
Run the code above in your browser using DataLab