R: Undirected degree

sociality-ergmTerm {ergm} | R Documentation

## Undirected degree

### Description

This term adds one network statistic for each node equal to the number of ties of that node. For directed networks, see `sender` and `receiver` .

### Usage

    # binary: sociality(attr=NULL, base=1, levels=NULL, nodes=-1)

    # valued: sociality(attr=NULL, base=1, levels=NULL, nodes=-1, form="sum")

### Arguments

`attr, levels` | this optional argument is deprecated and will be replaced with a more elegant implementation in a future release. In the meantime, it specifies a categorical vertex attribute (see Specifying Vertex attributes and Levels (`?nodal_attributes`) for details). If provided, this term only counts ties between nodes with the same value of the attribute (an actor-specific version of the `nodematch` term), restricted to be one of the values specified by (also deprecated) `levels` if `levels` is not `NULL` .
`base` | deprecated
`nodes` | By default, `nodes=-1` means that the statistic for the first node will be omitted, but this argument may be changed to control which statistics are included just as for the `nodes` argument of `sender` and `receiver` terms.
`form` | character how to aggregate tie values in a valued ERGM

### Note

The argument `base` is retained for backwards compatibility and may be removed in a future version. When both `base` and `levels` are passed, `levels` overrides `base`.

The argument `base` is retained for backwards compatibility and may be removed in a future version. When both `base` and `nodes` are passed, `nodes` overrides `base`.

This term can only be used with undirected networks.

### See Also

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

[Package ergm version 4.2.2 Index]