net.erdos.renyi.gnp function

Directed / Undirected Erdos-Renyi $G(n,p)$ network

Simulate a random network with n nodes and a link connecting probability of p, according to Edos and Renyi (1959).

net.erdos.renyi.gnp(n, p, ncores = detectCores(), d = TRUE)

Arguments

• n: Number of nodes of the network.
• p: Connecting probability.
• ncores: Number of cores, by default detectCores() from parallel.
• d: A logical value determining whether is a network directed (default) or indirected.

Returns

A list containing the nodes of the network and their respective neighbors.

Details

In this (simplest) random network, each edge is formed at random with a constant probability. When d = TRUE is a directed network.

Examples

## Not run:

x <- net.erdos.renyi.gnp(1000, 0.01)
## End(Not run)

References

Erdos, P. and Renyi, A., On random graphs, Publicationes Mathematicae 6, 290-297 (1959).

Author(s)

Luis Castro, Xu Dong, Nazrul Shaikh.