Abstract
Dynamic network data describe interactions among a fixed population through time. This data type can be modelled using the latent space framework, where the probability of a connection forming is expressed as a function of low-dimensional latent coordinates associated with the nodes, and sequential estimation of model parameters can be achieved via Sequential Monte Carlo (SMC) methods. In this setting, SMC is a natural candidate for estimation which offers greater scalability than existing approaches commonly considered in the literature, allows for estimates to be conveniently updated given additional observations and facilitates both online and offline inference. A novel approach to sequentially infer parameters of dynamic latent space network models is proposed by building on techniques from the high-dimensional SMC literature. The scalability and performance of the proposed approach is explored via simulation, and the flexibility under model variants is demonstrated. Finally, a real-world dataset describing classroom contacts is analysed using the proposed methodology.
Original language | English |
---|---|
Article number | 107627 |
Journal | Computational Statistics & Data Analysis |
Volume | 179 |
Early online date | 12 Oct 2022 |
DOIs | |
Publication status | Published - 31 Mar 2023 |
Bibliographical note
Funding Information:KT gratefully acknowledges the support of the EPSRC funded EP/L015692/1 STOR-i Centre for Doctoral Training and CN gratefully acknowledges the support of EPSRC grants EP/S00159X/1 , EP/R01860X/1 and EP/V022636/1 . We thank Daniele Durante for providing code for the Gaussian Process network model used in Section 5.1 , and we thank Brendan Murphy and Marco Battiston for helpful comments on an earlier version of this work.
Keywords
- Dynamic networks
- Latent space
- Sequential Monte Carlo
- Statistical network analysis
ASJC Scopus subject areas
- Statistics and Probability
- Computational Mathematics
- Computational Theory and Mathematics
- Applied Mathematics