This term adds one
network statistic to the model for each element of from (or to ); the \(i\) th
such statistic equals the number of nodes in the network of degree
greater than or equal to
from[i] but strictly less than to[i] , i.e. with edges
in semiopen interval [from,to) .
# binary: degrange(from, to=+Inf, by=NULL, homophily=FALSE, levels=NULL)vectors of distinct integers. If one of the vectors have length 1, it is recycled to the length of the other. Otherwise, it must have the same length.
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.
This term can only be used with undirected networks; for directed networks
see idegrange and odegrange . This term can be used
with bipartite networks, and will count nodes of both first and second mode in
the specified degree range. To count only nodes of the first mode ("actors"), use b1degrange
and to count only those fo the second mode ("events"), use b2degrange .
ergmTerm for index of model terms currently visible to the package.
ergm:::.formatTermKeywords("ergmTerm", "degrange", "subsection")