Creates a ring lattice with n vertices, each one of degree (at most) k
as an undirected graph. This is the basis of
Integer scalar. Size of the graph.
Integer scalar. Out-degree of each vertex.
Logical scalar. Whether the graph is undirected or not.
undirected=TRUE, the degree of each node always
even. So if
k=3, then the degree will be
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