Description Usage Arguments Details Value Author(s) References See Also Examples
This model is very simple, every possible edge is created with the same constant probability.
1 2 3 | sample_gnp(n, p, directed = FALSE, loops = FALSE)
gnp(...)
|
n |
The number of vertices in the graph. |
p |
The probability for drawing an edge between two arbitrary vertices (G(n,p) graph). |
directed |
Logical, whether the graph will be directed, defaults to FALSE. |
loops |
Logical, whether to add loop edges, defaults to FALSE. |
... |
Passed to |
The graph has ‘n’ vertices and for each edge the probability that it is present in the graph is ‘p’.
A graph object.
Gabor Csardi csardi.gabor@gmail.com
Erdos, P. and Renyi, A., On random graphs, Publicationes Mathematicae 6, 290–297 (1959).
1 2 | g <- sample_gnp(1000, 1/1000)
degree_distribution(g)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.