This term adds one
network statistic to the model for each element in k . The \(i\) th
such statistic counts the number of distinct k[i] -stars in the
network, where a \(k\) -star is defined to be a node \(N\) and a set of
\(k\) different nodes \(\{O_1, \dots, O_k\}\) such that the ties
\(\{N, O_i\}\) exist for \(i=1, \dots, k\) .
This term can only be used for undirected networks; for directed
networks, see istar , ostar , twopath and m2star .
Note that kstar(1) is equal to edges .
# binary: kstar(k, attr=NULL, levels=NULL)a vector of distinct integers
a vertex attribute specification; if attr is
specified, then the count is over the instances where all nodes
involved have the same value of the attribute. levels specified
which values of attr are included in the count. (See Specifying
Vertex attributes and Levels
(?nodal_attributes) for details.)
ergmTerm for index of model terms currently visible to the package.
ergm:::.formatTermKeywords("ergmTerm", "kstar", "subsection")