degree-ergmTerm

InitErgmTerm.degree

This term adds one
network statistic to the model for each element in <code>d</code> ; the \(i\) th
such statistic equals the number of nodes in the network of degree
<code>d[i]</code> , i.e. with exactly <code>d[i]</code> edges.
This term can only be used with undirected networks; for directed networks
see <code>idegree</code> and <code>odegree</code> .

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 (2023) <doi:10.18637/jss.v105.i06>.

Pavel N. Krivitsky

ergm

Fit, Simulate and Diagnose Exponential-Family Models for
Networks

Martina Morris

Li Wang

Kirk Li

Skye Bender-deMoll

Chad Klumb

Michał  Bojanowski

Ben Bolker

Christian Schmid

Joyce Cheng

Arya Karami

Adrien Le Guillou

degree-ergmTerm function

<dl><dt>d</dt>
<dd>vector of distinct integers</dd>
<dt>by, levels, homophily</dt>
<dd>the optional argument <code>by</code> specifies a vertex attribute (see Specifying
Vertex attributes and Levels (<code>?nodal_attributes</code>) for details).
If this is specified and <code>homophily</code> is <code>TRUE</code> ,
then degrees are calculated using the subnetwork consisting of only
edges whose endpoints have the same value of the <code>by</code> attribute.
If <code>by</code> is specified and
<code>homophily</code> is <code>FALSE</code> (the default), then separate degree range
statistics are calculated for nodes having each separate
value of the attribute. <code>levels</code> selects which levels of by` to include.</dd></dl>

Arguments

Degree — degree-ergmTerm

<dl>

<dt>d</dt>
<dd>vector of distinct integers</dd>


<dt>by, levels, homophily</dt>
<dd>the optional argument <code>by</code> specifies a vertex attribute (see Specifying
Vertex attributes and Levels (<code>?nodal_attributes</code>) for details).
If this is specified and <code>homophily</code> is <code>TRUE</code> ,
then degrees are calculated using the subnetwork consisting of only
edges whose endpoints have the same value of the <code>by</code> attribute.
If <code>by</code> is specified and
<code>homophily</code> is <code>FALSE</code> (the default), then separate degree range
statistics are calculated for nodes having each separate
value of the attribute. <code>levels</code> selects which levels of by` to include.</dd>

</dl>

Degree

degree-ergmTerm: Degree

Description

Usage

Arguments

See Also