idegreeL-ergmTerm {ergm.multi}

In-degree

Description

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 .

Usage

# binary: idegreeL(d, by=NULL, homophily=FALSE, levels=NULL)

Arguments

d

a vector of distinct integers.

by

an optional character string giving the name of an attribute in the network's vertex attribute list.

homophily

only applied if by is specified. If set (homophile == TRUE), then degrees are calculated using the subnetwork consisting of only edges whose endpoints have the same value of the by attribute. Otherwise (the default), then separate degree statistics are calculated for nodes having each separate value of the attribute.

levels

if by is specified, which levels to consider.

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

See Also

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

Keywords

None