Usage
bdgraph.sim(n = 1, p = 10, graph = "random", size = NULL, prob = NULL, v = NULL,
u = NULL, G = NULL, K = NULL, sigma = NULL, vis = FALSE)
Arguments
n
the number of samples required.
p
the number of variables (nodes).
graph
the graph structure with option "random", "fixed", and "circle". The default is "random".
size
the number of links in true graph (graph size).
prob
for "random" graph, it is the probability that a pair of nodes has a link. The default value is 0.2.
v
the off-diagonal elements of the precision matrix, controlling the magnitude of partial correlations with u.
The default value is 0.3.
u
a positive number being added to the diagonal elements of the precision matrix, to control the magnitude of partial
correlations. The default value is 0.1.
G
adjacency matrix which shows the graph structure. It is an upper triangular matrix in which $g_{ij}=1$ if there is a link between notes $i$ and
$j$, otherwise $g_{ij}=0$.
K
a positive-definite symmetric matrix specifying the precision matrix of the variables. It is for "fixed" option of graph.
sigma
a positive-definite symmetric matrix specifying the covariance matrix of the variables. It is for "fixed" option of graph.
vis
visualize the true graph pattern. The default value is FALSE.