mlergm (Q53922)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Multilevel Exponential-Family Random Graph Models
Language Label Description Also known as
default for all languages
No label defined
    English
    mlergm
    Multilevel Exponential-Family Random Graph Models

      Statements

      0 references
      0.8
      23 August 2021
      0 references
      PACKAGES.rds
      9 July 2026
      0 references
      0.1
      3 December 2018
      0 references
      0.2
      15 May 2019
      0 references
      0.3
      21 September 2019
      0 references
      0.4
      4 November 2019
      0 references
      0.5
      9 January 2020
      0 references
      0.6
      3 July 2020
      0 references
      0.7
      17 November 2020
      0 references
      0.8.1
      22 May 2025
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      22 May 2025
      0 references
      0 references
      0 references
      0 references
      Estimates exponential-family random graph models for multilevel network data, assuming the multilevel structure is observed. The scope, at present, covers multilevel models where the set of nodes is nested within known blocks. The estimation method uses Monte-Carlo maximum likelihood estimation (MCMLE) methods to estimate a variety of canonical or curved exponential family models for binary random graphs. MCMLE methods for curved exponential-family random graph models can be found in Hunter and Handcock (JCGS, 2006). The package supports parallel computing, and provides methods for assessing goodness-of-fit of models and visualization of networks.
      0 references

      Identifiers