Description Usage Arguments Details Value Author(s) References Examples
View source: R/net.erdos.renyi.gnp.R
Simulate a random network with n nodes and a link connecting probability of p, according to Edos and Renyi (1959).
1 | net.erdos.renyi.gnp(n, p, ncores = detectCores(), d = TRUE)
|
n |
Number of nodes of the network. |
p |
Connecting probability. |
ncores |
Number of cores, by default |
d |
A logical value determining whether is a network directed (default) or indirected. |
In this (simplest) random network, each edge is formed at random with a constant probability.
When d = TRUE
is a directed network.
A list containing the nodes of the network and their respective neighbors.
Luis Castro, 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.gnp(1000, 0.01)
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.