degreeL-ergmTerm {ergm.multi}

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 degree d[i] , i.e. with exactly d[i] edges.

This term can only be used with undirected networks; for directed networks see idegree and odegree .

Usage

# binary: degreeL(d, by=NULL, homophily=FALSE, levels=NULL, Ls=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

a list (constructed by list() or c() of one or more Layer Logic specifications (c.f. Layer Logic section in the Layer() documentation). If specified, 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.

Keywords

None