# sample_gnm

From igraph v1.2.5
by Gabor Csardi

##### Generate random graphs according to the G(n,m) Erdos-Renyi model

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

- Keywords
- graphs

##### Usage

`sample_gnm(n, m, directed = FALSE, loops = FALSE)`gnm(...)

##### Arguments

- n
The number of vertices in the graph.

- m
The number of edges in the graph.

- directed
Logical, whether the graph will be directed, defaults to FALSE.

- loops
Logical, whether to add loop edges, defaults to FALSE.

- ...
Passed to

`sample_app`

.

##### Details

The graph has ‘n’ vertices and ‘m’ edges,
and the ‘m’ edges are chosen uniformly randomly from the set of all
possible edges. This set includes loop edges as well if the `loops`

parameter is TRUE.

##### Value

A graph object.

##### References

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

##### See Also

##### Examples

```
# NOT RUN {
g <- sample_gnm(1000, 1000)
degree_distribution(g)
# }
```

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

### Community examples

Looks like there are no examples yet.