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 in-degree
greater than or equal to from[i] but strictly less than to[i] , i.e. with
in-edge count in semiopen interval [from,to) .
This term can only be used with directed networks; for undirected
networks (bipartite and not)
see degrange . For degrees of specific modes of bipartite
networks, see b1degrange and b2degrange . For
in-degrees, see idegrange .
# binary: idegrange(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.
ergmTerm for index of model terms currently visible to the package.
ergm:::.formatTermKeywords("ergmTerm", "idegrange", "subsection")