New node-oriented weighted four-cycle statistics for bipartite ERGMs are defined, implemented, and shown in simulation to avoid phase transitions exhibited by existing alternating two-path terms.
A Simple Algorithm for Scalable Monte Carlo Inference
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The methods of statistical physics are widely used for modelling complex networks. Building on the recently proposed Equilibrium Expectation approach, we derive a simple and efficient algorithm for maximum likelihood estimation (MLE) of parameters of exponential family distributions - a family of statistical models, that includes Ising model, Markov Random Field and Exponential Random Graph models. Computational experiments and analysis of empirical data demonstrate that the algorithm increases by orders of magnitude the size of network data amenable to Monte Carlo based inference. We report results suggesting that the applicability of the algorithm may readily be extended to the analysis of large samples of dependent observations commonly found in biology, sociology, astrophysics, and ecology.
citation-role summary
citation-polarity summary
fields
stat.ME 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Improving exponential-family random graph models for bipartite networks
New node-oriented weighted four-cycle statistics for bipartite ERGMs are defined, implemented, and shown in simulation to avoid phase transitions exhibited by existing alternating two-path terms.