Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints
Abstract Exponential Random Graph Models (ERGMs) have gained increasing popularity over the years. Rooted into statistical physics, the ERGMs framework has been successfully employed for reconstructing networks, detecting statistically significant patterns in graphs, counting networked configuration...
Saved in:
Main Authors: | Nicolò Vallarano, Matteo Bruno, Emiliano Marchese, Giuseppe Trapani, Fabio Saracco, Giulio Cimini, Mario Zanon, Tiziano Squartini |
---|---|
Format: | article |
Language: | EN |
Published: |
Nature Portfolio
2021
|
Subjects: | |
Online Access: | https://doaj.org/article/00f9f8db37124723b7faa9a1b6954d4c |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Networked partisanship and framing: A socio-semantic network analysis of the Italian debate on migration.
by: Tommaso Radicioni, et al.
Published: (2021) -
Analysing Twitter semantic networks: the case of 2018 Italian elections
by: Tommaso Radicioni, et al.
Published: (2021) -
Fast-forwarding of Hamiltonians and exponentially precise measurements
by: Yosi Atia, et al.
Published: (2017) -
Multi GPU parallelization of maximum likelihood expectation maximization method for digital rock tomography data
by: Jaya Prakash, et al.
Published: (2021) -
Parallel power posterior analyses for fast computation of marginal likelihoods in phylogenetics
by: Sebastian Höhna, et al.
Published: (2021)