Growing random graph generation
This function creates a random graph by simulating its stochastic evolution.
growing.random.game(n, m=1, directed=TRUE, citation=FALSE)
- Numeric constant, number of vertices in the graph.
- Numeric constant, number of edges added in each time step.
- Logical, whether to create a directed graph.
- Logical. If
TRUEa citation graph is created, ie. in each time step the added edges are originating from the new vertex.
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
FALSE these edges are connecting two
uniformly randomly chosen vertices, otherwise the edges are connecting
new vertex to uniformly randomly chosen old vertices.
- A new graph object.
g <- growing.random.game(500, citation=FALSE) g2 <- growing.random.game(500, citation=TRUE)