Description Usage Arguments Details Value References See Also

Creates a ring lattice with *n* vertices, each one of degree (at most) *k*
as an undirected graph. This is the basis of `rgraph_ws`

.

1 | ```
ring_lattice(n, k, undirected = FALSE)
``` |

`n` |
Integer scalar. Size of the graph. |

`k` |
Integer scalar. Out-degree of each vertex. |

`undirected` |
Logical scalar. Whether the graph is undirected or not. |

when `undirected=TRUE`

, the degree of each node always
even. So if `k=3`

, then the degree will be `2`

.

A sparse matrix of class `dgCMatrix`

of size
*n * n*.

Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of “small-world” networks. Nature, 393(6684), 440–2. http://doi.org/10.1038/30918

Other simulation functions: `permute_graph`

,
`rdiffnet`

, `rewire_graph`

,
`rgraph_ba`

, `rgraph_er`

,
`rgraph_ws`

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.