watts.strogatz.game          package:igraph          R Documentation

_T_h_e _W_a_t_t_s-_S_t_r_o_g_a_t_z _s_m_a_l_l-_w_o_r_l_d _m_o_d_e_l

_D_e_s_c_r_i_p_t_i_o_n:

     Generate a graph according to the Watts-Strogatz network model.

_U_s_a_g_e:

     watts.strogatz.game(dim, size, nei, p)

_A_r_g_u_m_e_n_t_s:

     dim: Integer constant, the dimension of the starting lattice.

    size: Integer constant, the size of the lattice along each
          dimension.

     nei: Integer constant, the neighborhood within which the vertices
          of the lattice will be connected.

       p: Real constant between zero and one, the rewiring probability. 

_D_e_t_a_i_l_s:

     First a lattice is created with the given 'dim', 'size' and 'nei'
     arguments. Then the edges of the lattice are rewired uniformly
     randomly with probability 'p'.

     Note that this function might create graphs with loops and/or
     multiple edges. You can use 'simplify' to get rid of these.

_V_a_l_u_e:

     A graph object.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_R_e_f_e_r_e_n_c_e_s:

     Duncan J Watts and Steven H Strogatz: Collective dynamics of
     'small world' networks, Nature 393, 440-442, 1998.

_S_e_e _A_l_s_o:

     'graph.lattice', 'rewire.edges'

_E_x_a_m_p_l_e_s:

     g <- watts.strogatz.game(1, 100, 5, 0.05)
     average.path.length(g)
     transitivity(g, type="average")

