This term adds one network statistic to
the model for each element in d ; the \(i\) th such statistic equals
the number of nodes in the network of out-degree d[i] , i.e. the
number of nodes with exactly d[i] out-edges.
# binary: odegreeL(d, by=NULL, homophily=FALSE, levels=NULL)a vector of distinct integers
a character string giving the name of an attribute in the network's vertex attribute list.
If this is specified and homophily is TRUE ,
then degrees are calculated using the subnetwork consisting of only
edges whose endpoints have the same value of the by attribute.
If by is specified and
homophily is FALSE (the default), then separate degree
statistics are calculated for nodes having each separate
value of the attribute.
either a Layer Logic specification formula (c.f. Layer Logic section in the Layer() documentation) or a list thereof (constructed by list() or c()). If given, degree of a node
list of layer specifications
This term can only be used with directed networks; for undirected networks
see degree .
If a list of layer specifications is given, degree of a node
i is considered to be the number of edges in all layers,
combined.
ergmTerm for index of model terms currently visible to the package.
ergm:::.formatTermKeywords("ergmTerm", "odegreeL", "subsection")