Bipartite random signed graphs

## Usage

```
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.

## Examples

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