odegreeL-ergmTerm-6345a9bc function

Out-degree

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)

Arguments

• d: a vector of distinct integers
• by: a character string giving the name of an attribute in the network's vertex attribute list.
• homophily: 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.
• Ls: 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
• levels: list of layer specifications

Details

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.

See Also

ergmTerm for index of model terms currently visible to the package.

ergm:::.formatTermKeywords("ergmTerm", "odegreeL", "subsection")