Description Usage Arguments Details Value Author(s) References Examples
Simulate a random network with n nodes and m edges, according to Erdos and Renyi (1959).
1 | net.erdos.renyi.gnm(n, m, ncores = detectCores(), d = TRUE)
|
n |
Number of nodes of the network. |
m |
Number of edges of the network. |
ncores |
Number of cores, by default |
d |
A logical value determining whether is a network directed (default) or indirected. |
In this (simplest) random network, m edges are formed at random among n nodes.
When d = TRUE
is a directed network.
A list containing the nodes of the network and their respective neighbors.
Xu Dong, Nazrul Shaikh.
Erdos, P. and Renyi, A., On random graphs, Publicationes Mathematicae 6, 290-297 (1959).
1 2 3 | ## Not run:
x <- net.erdos.renyi.gnm(1000, 100)
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.