growing.random.game          package:igraph          R Documentation

_G_r_o_w_i_n_g _r_a_n_d_o_m _g_r_a_p_h _g_e_n_e_r_a_t_i_o_n

_D_e_s_c_r_i_p_t_i_o_n:

     This function creates a random graph by simulating its stochastic
     evolution.

_U_s_a_g_e:

     growing.random.game(n, m=1, directed=TRUE, citation=FALSE)

_A_r_g_u_m_e_n_t_s:

       n: Numeric constant, number of vertices in the graph.

       m: Numeric constant, number of edges added in each time step.

directed: Logical, whether to create a directed graph.

citation: Logical. If 'TRUE' a citation graph is created, ie. in each
          time step the added edges are originating from the new
          vertex. 

_D_e_t_a_i_l_s:

     This is discrete time step model, in each time step a new vertex
     is added to the graph and 'm' new edges are created. If 'citation'
     is 'FALSE' these edges are connecting two uniformly randomly
     chosen vertices, otherwise the edges are connecting  new vertex to
     uniformly randomly chosen old vertices.

_V_a_l_u_e:

     A new graph object.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_S_e_e _A_l_s_o:

     'barabasi.game', 'erdos.renyi.game'

_E_x_a_m_p_l_e_s:

     g <- growing.random.game(500, citation=FALSE)
     g2 <- growing.random.game(500, citation=TRUE)

