Generate random signed graphs according to the G(n,p) Erdos-Renyi model

sample_gnp_signed(n, p, p_neg, directed = FALSE, loops = FALSE)

Arguments

n

The number of vertices in the graph.

p

The probability for drawing an edge between two arbitrary vertices.

p_neg

The probability of a drawn edge to be a negative tie

directed

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

loops

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

Value

a signed igraph graph object

References

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

Examples

sample_gnp_signed(10, 0.4, 0.5)
#> IGRAPH 8ba7317 U--- 10 14 -- Erdos-Renyi (gnp) graph
#> + attr: name (g/c), type (g/c), loops (g/l), p (g/n), sign (e/n)
#> + edges from 8ba7317:
#>  [1] 1-- 3 2-- 4 2-- 6 3-- 6 5-- 6 1-- 7 6-- 7 5-- 8 7-- 8 1-- 9 8-- 9 1--10
#> [13] 2--10 6--10