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. Possible arguments are: "random", or "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".

Value

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

fake documentation built on Jan. 18, 2026, 5:06 p.m.