# growing.random.game

From igraph v0.1.2
by Gabor Csardi

##### Growing random graph generation

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

- Keywords
- graphs

##### Usage

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

##### Arguments

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

##### Details

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.

##### Value

- A new graph object.

##### See Also

##### Examples

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

*Documentation reproduced from package igraph, version 0.1.2, License: GPL version 2 or later (June, 1991)*

### Community examples

Looks like there are no examples yet.