degreeL-ergmTerm

InitErgmTerm.degreeL

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> .

A set of extensions for the 'ergm' package to fit multilayer/multiplex/multirelational networks and samples of multiple networks. 'ergm.multi' is a part of the Statnet suite of packages for network analysis. See Krivitsky, Koehly, and Marcum (2020) <doi:10.1007/s11336-020-09720-7> and Krivitsky, Coletti, and Hens (2023) <doi:10.1080/01621459.2023.2242627>.

Pavel N. Krivitsky

ergm.multi

Fit, Simulate and Diagnose Exponential-Family Models for
Multiple or Multilayer Networks

Chad Klumb

Pietro Coletti

Joyce Cheng

degreeL-ergmTerm function

<dl><dt>d</dt>
<dd>a vector of distinct integers</dd>
<dt>by</dt>
<dd>a character string giving the name of an attribute in the
network's vertex attribute list.</dd>
<dt>homophily</dt>
<dd>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
statistics are calculated for nodes having each separate
value of the attribute.</dd>
<dt>Ls</dt>
<dd>a list (constructed by <code><a href="/link/list()?package=ergm.multi&version=0.2.1" data-mini-rdoc="ergm.multi::list()">list()</a></code> or <code><a href="/link/c()?package=ergm.multi&version=0.2.1" data-mini-rdoc="ergm.multi::c()">c()</a></code> of one or more Layer Logic specifications (c.f. Layer Logic section in the <code>Layer()</code> documentation). If specified, degree of a node <code>i</code> is considered to be the number of edges in all layers, combined.</dd></dl>

Arguments

Degree — degreeL-ergmTerm

<dl>

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


<dt>by</dt>
<dd>a character string giving the name of an attribute in the
network's vertex attribute list.</dd>


<dt>homophily</dt>
<dd>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
statistics are calculated for nodes having each separate
value of the attribute.</dd>


<dt>Ls</dt>
<dd>a list (constructed by <code><a href='https://rdrr.io/r/base/list.html'>list()</a></code> or <code><a href='https://rdrr.io/r/base/c.html'>c()</a></code> of one or more Layer Logic specifications (c.f. Layer Logic section in the <code>Layer()</code> documentation). If specified, degree of a node <code>i</code> is considered to be the number of edges in all layers, combined.</dd>

</dl>

degreeL-ergmTerm: Degree

Description

Usage

Arguments

See Also