R: In-degree

idegree-ergmTerm {ergm} | R Documentation

## 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: idegree(d, by=NULL, homophily=FALSE, levels=NULL)

### Arguments

`d` | a vector of distinct integers
`by, homophily` | 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` | TODO (See Specifying Vertex attributes and Levels (`?nodal_attributes`) for details.)

### See Also

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

[Package ergm version 4.2.1 Index]