threetrail-ergmTerm | R Documentation |
For an undirected network, this term adds one statistic equal to the number
of 3-trails, where a 3-trail is defined as a trail of length three that
traverses three distinct edges.
Note that a 3-trail need not
include four distinct nodes; in particular, a triangle counts as three
3-trails. For a directed network, this term adds four statistics
(or some subset of these four),
one for each of the four distinct types of directed three-paths. If the
nodes of the path are written from left to right such that the middle edge
points to the right (R), then the four types are RRR, RRL, LRR, and LRL.
That is, an RRR 3-trail is of the form
i\rightarrow j\rightarrow k\rightarrow l
, and RRL
3-trail is of the form
i\rightarrow j\rightarrow k\leftarrow l
, etc.
Like in the undirected case, there is no requirement that the nodes be
distinct in a directed 3-trail. However, the three edges must all be
distinct. Thus, a mutual tie i\leftrightarrow j
does not
count as a 3-trail of the form
i\rightarrow j\rightarrow i\leftarrow j
; however,
in the subnetwork i\leftrightarrow j \rightarrow k
,
there are two directed 3-trails, one LRR
( k\leftarrow j\rightarrow i\leftarrow j
)
and one RRR
( j\rightarrow i\rightarrow j\leftarrow k
).
# binary: threetrail(keep=NULL, levels=NULL)
# binary: threepath(keep=NULL, levels=NULL)
keep |
deprecated |
levels |
specify a subset of the four statistics for directed networks. (See Specifying Vertex
attributes and Levels ( |
The argument keep
is retained for backwards compatibility and may be
removed in a future version. When both keep
and levels
are passed,
levels
overrides keep
.
This term used to be (inaccurately) called threepath
. That
name has been deprecated and may be removed in a future version.
ergmTerm
for index of model terms currently visible to the package.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.