asymmetric.preference.game: Trait-based random generation

In igraph/rigraph: Network Analysis and Visualization

Trait-based random generation

Description

asymmetric.preference.game() was renamed to sample_asym_pref() to create a more consistent API.

Usage

asymmetric.preference.game(
  nodes,
  types,
  type.dist.matrix = matrix(1, types, types),
  pref.matrix = matrix(1, types, types),
  loops = FALSE
)

Arguments

nodes	The number of vertices in the graphs.
types	The number of different vertex types.
type.dist.matrix	The joint distribution of the in- and out-vertex types.
pref.matrix	A square matrix giving the preferences of the vertex types. The matrix has ‘types’ rows and columns. When generating an undirected graph, it must be symmetric.
loops	Logical constant, whether self-loops are allowed in the graph.

igraph/rigraph documentation built on May 4, 2024, 6:31 a.m.