# erdos.renyi.game

From igraph v0.5.5-3
by Gabor Csardi

##### Generate random graphs according to the Erdos-Renyi model

This model is very simple, every possible edge is created with the same constant probability.

- Keywords
- graphs

##### Usage

```
erdos.renyi.game(n, p.or.m, type=c("gnp", "gnm"),
directed = FALSE, loops = FALSE, ...)
```

##### Arguments

- n
- The number of vertices in the graph.
- p.or.m
- Either the probability for drawing an edge between two arbitrary vertices (G(n,p) graph), or the number of edges in the graph (for G(n,m) graphs).
- type
- The type of the random graph to create, either
`gnp`

(G(n,p) graph) or`gnm`

(G(n,m) graph). - directed
- Logical, whether the graph will be directed, defaults to FALSE.
- loops
- Logical, whether to add loop edges, defaults to FALSE.
- ...
- Additional arguments, ignored.

##### Details

In G(n,p) graphs, the graph has

In G(n,m) graphs, the graph has `loops`

parameter is TRUE.
`random.graph.game`

is an alias to this function.

##### Value

- A graph object.

##### concept

- Random graph model
- Erdos-Renyi graph

##### References

Erdos, P. and Renyi, A., On random graphs, *Publicationes
Mathematicae* 6, 290--297 (1959).

##### See Also

##### Examples

```
g <- erdos.renyi.game(1000, 1/1000)
degree.distribution(g)
```

*Documentation reproduced from package igraph, version 0.5.5-3, License: GPL (>= 2)*

### Community examples

Looks like there are no examples yet.