# watts.strogatz.game

From igraph v0.6.5-2
by Gabor Csardi

##### The Watts-Strogatz small-world model

Generate a graph according to the Watts-Strogatz network model.

- Keywords
- graphs

##### Usage

`watts.strogatz.game(dim, size, nei, p, loops = FALSE, multiple = FALSE)`

##### Arguments

- dim
- Integer constant, the dimension of the starting lattice.
- size
- Integer constant, the size of the lattice along each dimension.
- nei
- Integer constant, the neighborhood within which the vertices of the lattice will be connected.
- p
- Real constant between zero and one, the rewiring probability.
- loops
- Logical scalar, whether loops edges are allowed in the generated graph.
- multiple
- Logical scalar, whether multiple edges are allowed int the generated graph.

##### Details

First a lattice is created with the given `dim`

, `size`

and
`nei`

arguments. Then the edges of the lattice are rewired
uniformly randomly with probability `p`

.

Note that this function might create graphs with loops and/or multiple
edges. You can use `simplify`

to get rid of these.

##### Value

- A graph object.

##### concept

- Small-world model
- Watts-strogatz model

##### References

Duncan J Watts and Steven H Strogatz: Collective dynamics of

##### See Also

##### Examples

```
g <- watts.strogatz.game(1, 100, 5, 0.05)
average.path.length(g)
transitivity(g, type="average")
```

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

### Community examples

Looks like there are no examples yet.