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 in-degree d[i] , i.e. the number
of nodes with exactly d[i] in-edges.
This term can only be used with directed networks; for undirected networks
see degree .
# binary: idegree(d, by=NULL, homophily=FALSE, levels=NULL)a vector of distinct integers
the optional argument by specifies a vertex attribute (see Specifying
Vertex attributes and Levels (?nodal_attributes) for details).
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 range
statistics are calculated for nodes having each separate
value of the attribute. levels selects which levels of by` to include.
ergmTerm for index of model terms currently visible to the package.
ergm:::.formatTermKeywords("ergmTerm", "idegree", "subsection")