ergm
ergm copied to clipboard
statnet
Fit, Simulate and Diagnose Exponential-Family Models for Networks
Shared partner cache keeps track for each dyad how many shared partners (of specified type) does each dyad have. It's implemented as a hash table that only stores nonzero values....
They shouldn't need to reinitialise `ergm_model`s and `ergm_proposal`s from `ergm()`.
In particular, * `ergm_model` objects * `ergm_proposal` objects * `ergm_conlist` objects (after the first call to `free_dyads()`) * `network` objects should not exist any longer than needed.
I've implemented an argument in `mcmc.diagnostics()` to abbreviate the coefficient names and reduce the number of significant figures when printing correlation matrices and similar to make the output more concise....
The constraint simply takes the provided edgelist and fixes the corresponding dyads. It doesn't check if the edges in `present` are present, in `absent` are absent, and it doesn't modify...
According to the help: | Argument | function | | -- | -- | | search | optional character search term to search for in the text of the term...
# The problem: ``` r library(ergm) data(florentine) ## Business as dyad covariate for marriage flomarriage %n% "business" edgecov.business #> 8 ``` ``` r ## Consider a subgraph excluding nodes 1...
Some tests with bigger data show that MPLE existence checking in https://github.com/statnet/ergm/blob/1f4401ed73356cbf89c2f35fd35d6a981f4caea0/R/ergm.mple.R#L75 is time-consuming and memory-hungry. It's an LP so I guess there are little chances of making it leaner...
In https://github.com/statnet/ergm/blob/1f4401ed73356cbf89c2f35fd35d6a981f4caea0/R/ergm.mple.R#L100-L101 consider calling `glm.fit()` directly rather than `glm()`. Experiments with biggish data show that it might cut the computing time by half.
You can use non-bipartite terms in a GOF for a bipartite fit (e.g., degree, geodesics). It would be helpful to state explicitly how these non-bp statistics are calculated in the...