ergm.Cprepare
function builds an object called Clist that contains all the necessary ingredients to be passed to the C functions, other functions create edgelists and handle missing edge data.
ergm.Cprepare(nw, m, response = NULL)
ergm.Cprepare.el(x, attrname=NULL, prototype=NULL)
ergm.Cprepare.miss(nw)
ergm.design(nw, model, verbose = FALSE)
ergm.getmodel
x
is already an edgelist. (For example, if the prototype is undirected,
ergm.Cprepare.el
will ensure that $t < h$.)
ergm.Cprepare
returns Clist: a list of parameters used by several of the fitting routines containing
ergm.design
returns: Clist.miss
ergm.Cprepare
function header
ergm.Cprepare.miss
returns a vector of length 1+Nmissing*2. The first element is the number of missing edges, and the remainder a column-major edgelist
ergm.Cprepare
builds an object called Clist that contains all the necessary ingredients to be passed to the C functions
ergm.Cprepare.el
constructs and serializes a very simple static edgelist, with the vertex having the lesser index the tail and sorted by tails, then by heads.
ergm.Cprepare.miss
constructs an edgelist as ergm.Cprepare.el
, but only includes 'missing' edges (marked as NA)
ergm.design
functions as ergm.Cprepare
would, but acts on the network of missing edges