Generalized Poisson Dynamic Network Models

Giulia Carallo, Roberto Casarin and Antonio Peruzzi

Papers from arXiv.org

Abstract: Count-weighted temporal networks often exhibit unequal dispersion in the edge weights, which cannot be fully explained by modelling observational heterogeneity through latent factors in the conditional mean. Therefore, we propose new dynamic network model classes exploiting the Generalized Poisson distribution to capture both under- and overdispersion. We consider three different dynamic specifications: latent factor dynamics, autoregressive dynamics, and latent position dynamics, and study some theoretical properties of the random networks, showing the impact of the dispersion parameter on the random network's connectivity. After discussing the parameter identification strategy, we present a Bayesian inference procedure along with a posterior sampling algorithm. A numerical illustration demonstrates the effectiveness of the designed algorithm and provides estimates of the misspecification bias when unequal dispersion is neglected. Our new models are then applied to two relevant dynamic datasets considered in previous studies: a set of bike-sharing dynamic networks and a set of dynamic media networks. Our results highlight the importance of explicitly modeling overdispersion for both an accurate in-sample fit and out-of-sample performance.

Date: 2026-04, Revised 2026-04
New Economics Papers: this item is included in nep-ecm and nep-net
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2604.05838 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2604.05838

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().