Directed dyadwise shared partners

Description

This term adds one network statistic to the model for each element in d where the i th such statistic equals the number of dyads in the network with exactly d[i] shared partners.

Usage

# binary: ddsp(d, type="OTP")

Arguments

Note

This term can only be used with directed networks.

While there is only one shared partner configuration in the undirected case, nine distinct configurations are possible for directed graphs, selected using the type argument. Currently, terms may be defined with respect to five of these configurations; they are defined here as follows (using terminology from Butts (2008) and the relevent package):

• Outgoing Two-path ("OTP"): vertex k is an OTP shared partner of ordered pair (i,j) iff i->k->j. Also known as "transitive shared partner".

• Incoming Two-path ("ITP"): vertex k is an ITP shared partner of ordered pair (i,j) iff j->k->i. Also known as "cyclical shared partner"

• Reciprocated Two-path ("RTP"): vertex k is an RTP shared partner of ordered pair (i,j) iff i<->k<->j.

• Outgoing Shared Partner ("OSP"): vertex k is an OSP shared partner of ordered pair (i,j) iff i->k, j->k.

• Incoming Shared Partner ("ISP"): vertex k is an ISP shared partner of ordered pair (i,j) iff k->i, k->j. By default, outgoing two-paths ("OTP") are calculated. Note that Robins et al. (2009) define closely related statistics to several of the above, using slightly different terminology.

See Also

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