HugeAdjacency: Simulation of undirected graph

In fake: Flexible Data Simulation Using the Multivariate Normal Distribution

Simulation of undirected graph

Description

Simulates the adjacency matrix encoding an unweighted, undirected graph with no self-loops.

Usage

HugeAdjacency(pk = 10, topology = "random", nu = 0.1, ...)

Arguments

pk	number of nodes.
topology	topology of the simulated graph. If using implementation=HugeAdjacency, possible values are listed for the argument graph of huge.generator. These are: "random", "hub", "cluster", "band" and "scale-free".
nu	expected density (number of edges over the number of node pairs) of the graph. This argument is only used for topology="random" or topology="cluster" (see argument prob in huge.generator).
...	additional arguments to be passed to huge.generator.

Value

A symmetric adjacency matrix encoding an unweighted, undirected graph with no self-loops.

fake documentation built on April 14, 2023, 12:37 a.m.