• Corpus ID: 247476438

ergm 4: New features

@inproceedings{Krivitsky2021ergm4N,
  title={ergm 4: New features},
  author={Pavel N. Krivitsky and David R. Hunter and Martina M. Morris and Chad Klumb University of New South Wales and Pennsylvania State University and University of Washington},
  year={2021}
}
The ergm package supports the statistical analysis and simulation of network data. It anchors the statnet suite of packages for network analysis in R introduced in a special issue in Journal of Statistical Software in 2008. This article provides an overview of the new functionality in the 2021 release of ergm version 4. These include more flexible handling of nodal covariates, term operators that extend and simplify model specification, new models for networks with valued edges, improved… 

Figures from this paper

References

SHOWING 1-10 OF 39 REFERENCES

Social Network Analysis with sna

An overview of a software package which provides support for a range of network analytic functionality within the R statistical computing environment is provided.

A novitiate in a period of change: An experimental and case study of social relationships

  • 1968

Modeling valued networks with statnet

3 Valued ERGMs 9 3.1 Modeling dyad-dependent interaction counts using ergm.count . . . . . . . . . 9 3.1.1 Valued ERGMs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1.2 Valued

Sharing social network data: differentially private estimation of exponential family random‐graph models

This work uses a simple yet effective randomized response mechanism to generate synthetic networks under ε‐edge differential privacy and then uses likelihood‐based inference for missing data and Markov chain Monte Carlo techniques to fit exponential family random‐graph models to the generated synthetic networks.

Exponential-family random graph models for valued networks.

  • P. Krivitsky
  • Computer Science
    Electronic journal of statistics
  • 2012
This work forms an ERGM for networks whose ties are counts and discusses issues that arise when moving beyond the binary case and introduces model terms that generalize and model common social network features for such data and apply these methods to a network dataset whose values are counts of interactions.

Exponential-Family Random Graph Models for Multi-Layer Networks.

Extensions to ERGMs are introduced to address limitations: Conway-Maxwell-Binomial distribution to model the marginal dependence among multiple layers; a "layer logic" language to translate familiar ERGM effects to substantively meaningful interactions of observed layers; and nondegenerate triadic and degree effects.

Improving ERGM Starting Values Using Simulated Annealing

The method proposed has shown its merit in producing an MLE for a network dataset and model that had defied estimation using all other known methods and is exploited here to search for improved starting values for approximation-based MLE methods.

Exponential random graph models for little networks

Logit models and logistic regressions for social networks: III. Valued relations

This paper generalizes thep* model for dichotomous social network data to the polytomous case by transforming valued social networks into three-way binary arrays and demonstrates that a suitable version of the Hammersley-Clifford theorem can be developed.