Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T11:00:35.954Z Has data issue: false hasContentIssue false

Bayesian model selection for the latent position cluster model for social networks

Published online by Cambridge University Press:  03 April 2017

CAITRÍONA RYAN
Affiliation:
Department of Mathematics and Statistics, University of Limerick, Limerick, Ireland (e-mail: Caitriona.Ryan@ul.ie)
JASON WYSE
Affiliation:
Discipline of Statistics, School of Computer Science and Statistics, Trinity College Dublin, College Green, Dublin 2, Ireland (e-mail: wyseja@tcd.ie)
NIAL FRIEL
Affiliation:
School of Mathematics and Statistics and Insight: The National Centre for Big Data Analytics, University College Dublin, Belfield, Dublin 4, Ireland (e-mail: nial.friel@ucd.ie)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The latent position cluster model is a popular model for the statistical analysis of network data. This model assumes that there is an underlying latent space in which the actors follow a finite mixture distribution. Moreover, actors which are close in this latent space are more likely to be tied by an edge. This is an appealing approach since it allows the model to cluster actors which consequently provides the practitioner with useful qualitative information. However, exploring the uncertainty in the number of underlying latent components in the mixture distribution is a complex task. The current state-of-the-art is to use an approximate form of BIC for this purpose, where an approximation of the log-likelihood is used instead of the true log-likelihood which is unavailable. The main contribution of this paper is to show that through the use of conjugate prior distributions, it is possible to analytically integrate out almost all of the model parameters, leaving a posterior distribution which depends on the allocation vector of the mixture model. This enables posterior inference over the number of components in the latent mixture distribution without using trans-dimensional MCMC algorithms such as reversible jump MCMC. Our approach is compared with the state-of-the-art latentnet (Krivitsky & Handcock, 2015) and VBLPCM (Salter-Townshend & Murphy, 2013) packages.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2017