transitiveties-ergmTerm

InitErgmTerm.transitiveties

This term adds one statistic, equal to the number of ties
\(i\rightarrow j\) such that there exists a two-path from
\(i\) to \(j\) . (Related to the <code>ttriple</code> term.)

An integrated set of tools to analyze and simulate networks based on exponential-family random graph models (ERGMs). 'ergm' is a part of the Statnet suite of packages for network analysis. See Hunter, Handcock, Butts, Goodreau, and Morris (2008) <doi:10.18637/jss.v024.i03> and Krivitsky, Hunter, Morris, and Klumb (2021) <arXiv:2106.04997>.

Pavel N. Krivitsky

ergm

Fit, Simulate and Diagnose Exponential-Family Models for
Networks

Mark S. Handcock

David R. Hunter

Carter T. Butts

Steven M. Goodreau

Martina Morris

Li Wang

Kirk Li

Skye Bender-deMoll

Chad Klumb

Michał  Bojanowski

Ben Bolker

Christian Schmid

Joyce Cheng

transitiveties-ergmTerm function

<dl><dt>attr</dt>
<dd>quantitative attribute (see Specifying Vertex attributes and Levels (<code>?nodal_attributes</code>) for details.) If set, all three nodes involved ( \(i\) , \(j\) , and the node on the two-path) must match
on this attribute in order for \(i\rightarrow j\) to be counted.</dd>
<dt>levels</dt>
<dd>TODO (See Specifying Vertex
attributes and Levels (<code>?nodal_attributes</code>) for details.)</dd></dl>

Arguments

Transitive ties — transitiveties-ergmTerm

<dl>

<dt>attr</dt>
<dd>quantitative attribute (see Specifying Vertex attributes and Levels (<code>?nodal_attributes</code>) for details.) If set, all three nodes involved ( \(i\) , \(j\) , and the node on the two-path) must match
on this attribute in order for \(i\rightarrow j\) to be counted.</dd>


<dt>levels</dt>
<dd>TODO (See Specifying Vertex
attributes and Levels (<code>?nodal_attributes</code>) for details.)</dd>

</dl>

Transitive ties

Last chance! 50% off unlimited learning

transitiveties-ergmTerm: Transitive ties

Description

Usage

Arguments

See Also