Ring lattice graph

Share:

Description

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.

Usage

1
ring_lattice(n, k, undirected = FALSE)

Arguments

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.

Details

when undirected=TRUE, the degree of each node always even. So if k=3, then the degree will be 2.

Value

A sparse matrix of class dgCMatrix of size n * n.

References

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

See Also

Other simulation functions: permute_graph, rdiffnet, rewire_graph, rgraph_ba, rgraph_er, rgraph_ws

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.