sample_bipartite_signed: Bipartite random signed graphs

In signnet: Methods to Analyse Signed Networks

Bipartite random signed graphs

Description

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.

Value

A signed bipartite igraph graph.

Examples

sample_bipartite_signed(10, 10, 0.5, 0.5)

signnet documentation built on April 3, 2025, 11:06 p.m.