graph-motifs             package:igraph             R Documentation

_G_r_a_p_h _m_o_t_i_f_s

_D_e_s_c_r_i_p_t_i_o_n:

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

_U_s_a_g_e:

     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) 

_A_r_g_u_m_e_n_t_s:

   graph: Graph object, the input graph.

    size: The size of the motif, currently 3 and 4 are supported only.

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 is 'NULL'.

  sample: If not 'NULL' then it specifies the vertices to use as a
          starting point for finding motifs.

_D_e_t_a_i_l_s:

     '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.

_V_a_l_u_e:

     'graph.motifs' returns a numeric vector.

     'graph.motifs.no' and 'graph.motifs.est' return a numeric
     constant.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_S_e_e _A_l_s_o:

     'graph.isoclass'

_E_x_a_m_p_l_e_s:

     g <- barabasi.game(100)
     graph.motifs(g, 3)
     graph.motifs.no(g, 3)
     graph.motifs.est(g, 3)

