This term adds one statistic to the model equal to the number of triangles in the network between nodes "close to" each other. For an undirected network, a local triangle is defined to be any set of three edges between nodal pairs \(\{(i,j), (j,k), (k,i)\}\) that are in the same neighborhood. For a directed network, a triangle is defined as any set of three edges \((i{\rightarrow}j), (j{\rightarrow}k)\) and either \((k{\rightarrow}i)\) or \((k{\leftarrow}i)\) where again all nodes are within the same neighborhood.
# binary: localtriangle(x)an undirected
network or an symmetric adjacency matrix that specifies whether the two nodes
are in the same neighborhood. Note that triangle , with or without an argument, is a
special case of localtriangle .
ergmTerm for index of model terms currently visible to the package.
ergm:::.formatTermKeywords("ergmTerm", "localtriangle", "subsection")