powered by

This model is very simple, every possible edge is created with the same constant probability.

sample_gnp(n, p, directed = FALSE, loops = FALSE)gnp(...)

gnp(...)

The number of vertices in the graph.

The probability for drawing an edge between two arbitrary vertices (G(n,p) graph).

Logical, whether the graph will be directed, defaults to FALSE.

Logical, whether to add loop edges, defaults to FALSE.

Passed to sample_app.

sample_app

A graph object.

The graph has ‘n’ vertices and for each edge the probability that it is present in the graph is ‘p’.

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

sample_gnm, sample_pa

sample_gnm

sample_pa

# NOT RUN { g <- sample_gnp(1000, 1/1000) degree_distribution(g) # }

Run the code above in your browser using DataLab