Implements clustering and estimates parameters in Exponential-Family Random Graph Models for static undirected and directed networks, developed in Vu et al. (2013) <https://projecteuclid.org/euclid.aoas/1372338477>.

Provides tools for simulating draws from continuous time processes with well-defined exponential family random graph (ERGM) equilibria, i.e. ERGM generating processes (EGPs).  A number of EGPs are supported, including the families identified in Butts (2023) <doi:10.1080/0022250X.2023.2180001>, as are functions for hazard calculation and timing calibration.

Data for use with the Sage Introduction to Exponential
        Random Graph Modeling text by Jenine K. Harris.  Network data
        set consists of 1283 local health departments and the
        communication links among them along with several attributes.

Simulation and estimation of Exponential Random Graph Models (ERGMs)
  for small networks using exact statistics as shown in Vega Yon et al. (2020)
  <DOI:10.1016/j.socnet.2020.07.005>. As a difference from the 'ergm'
  package, 'ergmito' circumvents using Markov-Chain Maximum Likelihood Estimator
  (MC-MLE) and instead uses Maximum Likelihood Estimator (MLE) to fit ERGMs
  for small networks. As exhaustive enumeration is computationally feasible for
  small networks, this R package takes advantage of this and provides tools for
  calculating likelihood functions, and other relevant functions, directly,
  meaning that in many cases both estimation and simulation of ERGMs for
  small networks can be faster and more accurate than simulation-based
  algorithms.

Provides several validator functions for checking if arguments
    passed by users have valid types, lengths, etc. and for generating
    informative and well-formatted error messages in a consistent style. Also
    provides tools for users to create their own validator functions. The
    error message style used is adopted from
    <https://style.tidyverse.org/error-messages.html>.

Provides a set of functions to solve Erlang-C model. The Erlang C formula was invented by the Danish Mathematician A.K. Erlang and is used to calculate the number of advisors and the service level.