- p
number of variables (nodes).
- graph
undirected graph with options
"random
", "cluster
", "smallworld
", "scale-free
", "lattice
", "hub
", "star
", and "circle
".
It also could be an adjacency matrix corresponding to a graph structure (an upper triangular matrix in which
\(g_{ij}=1\) if there is a link between notes \(i\) and \(j\), otherwise \(g_{ij}=0\)).
- prob
if graph
= "random
", it is the probability that a pair of nodes has a link.
- size
number of links in the true graph (graph size).
- class
if graph
= "cluster
", it is the number of classes.
- vis
visualize the true graph structure.
- rewire
rewiring probability for smallworld network. Must be between 0 and 1.