ergmKeyword {ergm}R Documentation

Keywords defined for Exponential-Family Random Graph Models

Description

This collects all defined keywords defined for the ERGM and derived packages

Possible keywords defined by the ERGM and derived packages

name short description popular package
binary bin suitable for binary ERGMs TRUE ergm
bipartite bip suitable for bipartite networks TRUE ergm
categorical nodal attribute cat nodal attr involves a categorical nodal attribute FALSE ergm
categorical dyadic attribute cat dyad attr involves a categorical dyadic attribute FALSE ergm
categorical triadic attribute cat triad attr involves a categorical triadic attribute FALSE ergm
continuous cont a continuous distribution for edge values FALSE ergm
curved curved is a curved term FALSE ergm
directed dir suitable for directed networks TRUE ergm
discrete discrete a discrete distribution for edge values FALSE ergm
dyad-independent dyad-indep does not induce dyadic dependence TRUE ergm
finite fin finite edge values only FALSE ergm
frequently-used freq is frequently used FALSE ergm
nonnegative nneg only meaningful for nonnegative edge values FALSE ergm
operator op a term operator TRUE ergm
positive pos only meaningful for positive edge values FALSE ergm
quantitative nodal attribute quant nodal attr involves a quantitative nodal attribute FALSE ergm
quantitative dyadic attribute quant dyad attr involves a quantitative dyadic attribute FALSE ergm
quantitative triadic attribute quant triad attr involves a quantitative triadic attribute FALSE ergm
soft soft a constraint that does not necessarily forbid specific networks outright but reweights their probabilities FALSE ergm
triad-related triad rel involves triangles, two-paths, and other triadic structures FALSE ergm
valued val suitable for valued ERGMs TRUE ergm
undirected undir suitable for undirected networks TRUE ergm
[Package ergm version 4.2.2 Index]