Properties of Latent Variable Network Models

Abstract

We derive properties of Latent Variable Models for networks, a broad class of models that includes the widely-used Latent Position Models. These include the average degree distribution, clustering coefficient, average path length and degree correlations. We introduce the Gaussian Latent Position Model, and derive analytic expressions and asymptotic approximations for its network properties. We pay particular attention to one special case, the Gaussian Latent Position Models with Random Effects, and show that it can represent the heavy-tailed degree distributions, positive asymptotic clustering coefficients and small-world behaviours that are often observed in social networks. Several real and simulated examples illustrate the ability of the models to capture important features of observed networks.

References in corpus (15)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Assortative mixing in networks
• Finding community structure in networks using the eigenvectors of matrices
• The diameter of the world wide web
• Random graphs with arbitrary degree distributions and their applications
• Random graphs with clustering
• A Separable Model for Dynamic Networks
• Properties of highly clustered networks
• Class of correlated random networks with hidden variables
• Average path length in random networks
• Average path length in uncorrelated random networks with hidden variables
• Random graphs as models of networks
• Convergence of the groups posterior distribution in latent or stochastic block models
• Degree-based network models