TODO
ConstantEdges-ergmProposal
MHp for edges constraints
TODO
CondOutDegree-ergmProposal
MHp for odegree constraints
Discrete Uniform reference
DiscUnifNonObserved-ergmProposal
TODO
Impose a curved structure on term parameters
Constrain fixed or varying dyad-independent terms
TODO
Terms with fixed coefficients
HammingConstantEdges-ergmProposal
TODO
Take a natural logarithm of a network's statistic
CondOutDegreeDist-ergmProposal
MHp for odegreedist constraints
A sum (or an arbitrary linear combination) of one or more formulas
Standard Normal reference
TODO
Modify terms' coefficient names
A product (or an arbitrary power combination) of one or more formulas
Alternating \(k\)-star
Filtering on nodematch
Categorical absolute difference in nodal attribute
Absolute difference in nodal attribute
UnifNonObserved-ergmProposal
TODO
Evaluation on an induced subgraph
Number of dyads with values less than or equal to a threshold
TODO
Edge covariate by attribute pairing
ANOVA for ERGM Fits
Exponentiate a network's statistic
Evaluation on symmetrized (undirected) network
Default MH algorithm
Filtering on arbitrary one-term model
Create a Simple Random network of a Given Size
Continuous Uniform reference
Number of dyads with values greater than or equal to a threshold
Asymmetric dyads
TODO
approx.hotelling.diff.test
Approximate Hotelling T^2-Test for One or Two Population Means
\(k\)-stars for the first mode in a bipartite network
Mixing matrix for \(k\)-stars centered on the first mode of a bipartite network
Nodal attribute-based homophily effect for the first mode in a bipartite network
Block-diagonal structure constraint
Preserve the actor degree for bipartite networks
Degree
Extract dyad-level ERGM constraint information into an rlebdm
object
Constrain maximum and minimum vertex degree
Degree
Factor attribute effect for the first mode in a bipartite network
Preserve the receiver degree for bipartite networks
Dyadwise shared partners for dyads in the first bipartition
Minimum degree for the first mode in a bipartite network
Degree for the second mode in a bipartite network
Balanced triads
Degree range for the first mode in a bipartite network
Degree for the first mode in a bipartite network
Constrain blocks of dyads defined by mixing type on a vertex attribute.
Dyadwise shared partners for dyads in the second bipartition
Target statistics and model fit to a hypothetical 50,000-node network population with
50,000 nodes based on egocent
Main effect of a covariate for the second mode in a bipartite network
Locate and call an ERGM term initialization function.
Ensures an Ergm Term and its Arguments Meet Appropriate Conditions
Concurrent node count for the first mode in a bipartite network
Concurrent node count for the second mode in a bipartite network
Control parameters for ergm.godfather()
.
Main effect of a covariate for the first mode in a bipartite network
Two-star census for central nodes centered on the first mode of a bipartite network
Nodal attribute-based homophily effect for the second mode in a bipartite network
Degree range for the second mode in a bipartite network
Cyclical ties
Minimum degree for the second mode in a bipartite network
Degree
Degree range
Cyclical weights
Dyadic covariate
Directed dyadwise shared partners
Coincident node count for the second mode in a bipartite (aka two-mode) network
\(k\)-stars for the second mode in a bipartite network
Cyclic triples
Concurrent tie count
Concurrent node count
Degree Correlation
Degree Cross-Product
Degree to the 3/2 power
Factor attribute effect for the second mode in a bipartite network
dyadnoiseTNT-ergmProposal
TODO
A meta-constraint indicating handling of arbitrary dyadic constraints
Mixing matrix for \(k\)-stars centered on the second mode of a bipartite network
degreedist-ergmConstraint
Preserve the degree distribution of the given network
egocentric-ergmConstraint
Preserve values of dyads incident on vertices with given attribute
Two-star census for central nodes centered on the second mode of a bipartite network
Density
Functions that have been removed from this package
Auxiliaries for Controlling ergm.bridge.llr()
and logLik.ergm()
Auxiliary for Controlling ERGM Fitting
Auxiliary for Controlling ERGM Goodness-of-Fit Evaluation
Obtain the set of informative dyads based on the network structure.
Number of dyads with values equal to a specific value (within tolerance)
k-Cycle Census
Bridge sampling to evaluate ERGM log-likelihoods and log-likelihood ratios
enformulate.curved-deprecated
Convert a curved ERGM into a form suitable as initial values for the same
ergm. Deprecated in 4.0.0.
Auxiliary for Controlling SAN
Difference
Edge covariate
Two versions of an E. Coli network dataset
Parallel Processing in the ergm
Package
Find a maximizer to the psuedolikelihood function
Reference Measures for Exponential-Family Random Graph Models
Sample Space Constraints for Exponential-Family Random Graph Models
Fit, Simulate and Diagnose Exponential-Family Models for Networks
Compute the Sample Estimating Function Values of an ERGM.
A helper function to select and construct a dyad generator for C.
Operations to map curved ergm()
parameters onto canonical parameters
Deallocate the C data structures corresponding to an ergm_state
left over from a .Call()
run. Calculate all possible vectors of statistics on a network for an ERGM
MCMC Hints for Exponential-Family Random Graph Models
Exponential-Family Random Graph Models
A soft constraint to adjust the sampled distribution for
dyad-level noise with known perturbation probabilities
TODO
A common pattern for obtaining an edge covariate
Auxiliary for Controlling ERGM Simulation
Plot MCMC list using lattice
package graphics
Terms used in Exponential Family Random Graph Models
Internal representation of an ergm
network model
Preserve the degree of each vertex of the given network
Computes and Returns the Degree Distribution Information for a Given Network
Preserve the edge count of the given network
Return a symmetrized version of a binary network
Keywords defined for Exponential-Family Random Graph Models
Curved settings for geometric weights for the gw*
terms
Internal ergm Objects
Global options and term options for the ergm
package
Acquire and verify the network from the LHS of an ergm
formula
and verify that it is a valid network.
A function to apply a given series of changes to a network.
Internal Function to Sample Networks and Network Statistics
Internal Function to Perform Simulated Annealing
A rudimentary cache for large objects
Functions to initialize the ergm_proposal object
Combine an operator term's and a subterm's name in a standard fashion.
Metropolis-Hastings Proposal Methods for ERGM MCMC
Faux dixon High School as a network object
ERGM Predictors and response for logistic regression calculation of MPLE
Conduct Goodness-of-Fit Diagnostics on a Exponential Family Random Graph
Model
Dynamic ERGM keyword registry
A Representation of ERGM state
Geometrically weighted degree distribution for the first mode in a bipartite network
An API for specifying aspects of an ergm
model in the
LHS/basis network.
Table mapping reference,constraints, etc. to ERGM Metropolis-Hastings proposals
Geometrically weighted dyadwise shared partner distribution for dyads in the first bipartition
Goodreau's Faux Magnolia High School as a network object
Retrieve and check assumptions about vertex attributes (nodal covariates) in
a network
Number of dyads with values strictly greater than a threshold
Intransitive triads
Testing for curved exponential family
Directed edgewise shared partners
Faux desert High School as a network object
Number of edges in the network
Hamming distance
Preserve indegree for directed networks
Number of dyads whose values are in an interval
Isolated edges
Preserve the hamming distance to the given network (BROKEN: Do NOT Use)
Multivariate version of coda
's coda::geweke.diag()
.
Florentine Family Marriage and Business Ties Data as a "network" object
Isolates
Geometrically weighted dyadwise shared partner distribution for dyads in the second bipartition
Geometrically weighted degree distribution for the second mode in a bipartite network
In-degree range
Goodreau's four node network as a "network" object
Near simmelian triads
Functions that will no longer be supported in future releases of the package
A convenience container for a list of network
objects, output
by simulate.ergm
among others.
Mean vertex degree
In-degree
In-stars
Kapferer's tailor shop data
Geometrically weighted non-edgewise shared partner distribution
Mixing matrix cells and margins
Main effect of a covariate for out-edges
Factor attribute effect
Calculate the exact loglikelihood for an ERGM
Main effect of a covariate for in-edges
Sensible error and warning messages by ergm
initializers
Helper function for constructing gw*
cutoff error messages
Initializes the parameters to bound degree during sampling
Calculate geodesic distance distribution for a network or edgelist
\(k\)-stars
Copy network- and vertex-level attributes between two network objects
Covariance of out-dyad values incident on each actor
Directed non-edgewise shared partners
Geometrically weighted out-degree distribution
Testing for dyad-independence
Triangles within neighborhoods
Update the network and the response argument.
Main effect of a covariate
ergm_propagate_ext.encode
Extended states for submodels
Preserve the dyad status in all but the given edges
Goodreau's Faux Mesa High School as a network object
Geometrically weighted in-degree distribution
Geometrically weighted edgewise shared partner distribution
In-degree to the 3/2 power
Geometrically weighted degree distribution
Preserve and preclude edges
Convert a curved ERGM into a corresponding "fixed" ERGM.
idegreedist-ergmConstraint
Preserve the indegree distribution
Covariance of undirected dyad values incident on each actor
Uniform homophily and differential homophily
Nodal attribute mixing
Out-degree
Helper functions for specifying nodal attribute levels
Geometrically weighted dyadwise shared partner distribution
Specifying nodal attributes and their levels
Search ERGM terms, constraints, references, hints, and proposals
Generate networks with a given set of network statistics
Function to check whether an ERGM fit or some aspect of it is valued
Mutuality
Synthetic network with 20 nodes and 28 edges
Mixed 2-stars, a.k.a 2-paths
odegreedist-ergmConstraint
Preserve the outdegree distribution
Conduct MCMC diagnostics on a model fit
Covariance of in-dyad values incident on each actor
Factor attribute effect for in-edges
Calculate the null model likelihood
A logLik
method for ergm
fits. Evaluate network summary statistics from an initialized ergm model
Summarizing ERGM Model Fits
Longitudinal networks of positive affection within a monastery as a
"network" object
Out-degree to the 3/2 power
Open triads
Preserve outdegree for directed networks
Draw from the distribution of an Exponential Family Random Graph Model
A simulate
Method for formula
objects that dispatches based on the Left-Hand Side
Receiver effect
Preserve the observed dyads of the given network
Length of the parameter vector associated with an object or with its terms.
Factor attribute effect for out-edges
Out-degree range
RLE-Compressed Boolean Dyad Matrix
k-Outstars
A lack-of-fit test for ERGMs
Number of dyads with values strictly smaller than a threshold
randomtoggle-ergmProposal
Propose a randomly selected dyad to toggle
Number of ties between actors with similar attribute values
Cumulative network of positive affection within a monastery as a "network"
object
Names of the parameters associated with an object.
ERGM-based tie probabilities
Simmelian triads
Statnet Control
Dispatching a summary function based on the class of the LHS of a
formula.
Stratify Proposed Toggles by Mixing Type on a Vertex Attribute
Triangles
Triangle percentage
Undirected degree
Calculation of network or graph statistics or other attributes
specified on a formula
Three-trails
Ties in simmelian triads
Methods to serialize objects into numeric vectors for passing to the C side.
Transitive triples
2-Paths
Sum of dyad values (optionally taken to a power)
Sender effect
Identify the position of a point relative to the convex hull of a set of points
transitiveweights-ergmTerm
Transitive weights
Sparse network
Triad census
Multivariate version of coda
's spectrum0.ar()
.
Wrap a submodel's curved, empty network statistics, and extended
state (read-only) specification (if present) for output from an
InitErgmTerm
or InitWtErgmTerm
.
Transitive triads
Transitive ties
Update the edges in a network based on a matrix
Weighted Median
Bernoulli reference
CondB2Degree-ergmProposal
MHp for b2degree constraints
Wrap binary terms for use in valued models
TNT proposal with degree bounds, stratification, and a blocks constraint
CondInDegree-ergmProposal
MHp for idegree constraints
MHp for degree constraints
CondDegreeMix-ergmProposal
MHp for degree mix constraints
CondDegreeDist-ergmProposal
MHp for degreedist constraints
CondB1Degree-ergmProposal
MHp for b1degree constraints
CondInDegreeDist-ergmProposal
MHp for idegreedist constraints