Bayesian inference for dynamic social network data

Journal article

We consider a continuous-time model for the evolution of social networks. A social network is here conceived as a (di-) graph on a set of vertices, representing actors, and the changes of interest are creation and disappearance over time of (arcs) edges in the graph. Hence we model a collection of random edge indicators that are not, in general, independent. We explicitly model the interdependencies between edge indicators that arise from interaction between social entities. A Markov chain is defined in terms of an embedded chain with holding times and transition probabilities. Data are observed at fixed points in time and hence we are not able to observe the embedded chain directly. Introducing a prior distribution for the parameters we may implement an MCMC algorithm for exploring the posterior distribution of the parameters by simulating the evolution of the embedded process between observations.

Authors: Snijders, T; Koskinen, J

• Publisher: Elsevier
• Journal: Journal of Statistical Planning and Inference
• Volume: Vol. 137, 12
• Pages: 3930-3938
• Publication date: 2007-12-01