Bipartite random signed graphs

sample_bipartite_signed(
n1,
n2,
p,
p_neg,
directed = FALSE,
mode = c("out", "in", "all")
)

## Arguments

n1

Integer scalar, the number of bottom vertices.

n2

Integer scalar, the number of top vertices.

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.

mode

Character scalar, specifies how to direct the edges in directed graphs. If it is ‘out’, then directed edges point from bottom vertices to top vertices. If it is ‘in’, edges point from top vertices to bottom vertices. ‘out’ and ‘in’ do not generate mutual edges. If this argument is ‘all’, then each edge direction is considered independently and mutual edges might be generated. This argument is ignored for undirected graphs.

## Value

A signed bipartite igraph graph.

## Examples

sample_bipartite_signed(10,10,0.5,0.5)
#> IGRAPH 2f72db4 U--B 20 57 -- Bipartite Gnp random graph
#> + attr: name (g/c), p (g/n), type (v/l), sign (e/n)
#> + edges from 2f72db4:
#>  [1]  3--11  5--11  6--11  9--11 10--11  2--12  5--12  6--12  7--12  8--12
#> [11]  1--13  2--13  3--13  4--13  5--13  7--13  9--13  1--14  4--14  5--14
#> [21]  7--14  8--14  9--14 10--14  2--15  3--15  5--15  6--15  7--15  8--15
#> [31] 10--15  2--16  4--16  5--16  6--16  8--16  9--16  7--17  8--17 10--17
#> [41]  3--18  4--18  8--18  9--18  2--19  3--19  4--19  6--19  7--19  9--19
#> [51]  2--20  3--20  5--20  7--20  8--20  9--20 10--20