Latent Space Network Modelling with Continuous and Discrete Geometries
share
A rich class of network models associate each node with a low-dimensional latent coordinate that controls the propensity for connections to form. Models of this type are well established in the literature, where it is typical to assume that the underlying geometry is Euclidean. Recent work has explored the consequences of this choice and has motivated the study of models which rely on non-Euclidean latent geometries, with a primary focus on spherical and hyperbolic geometry. In this paper[This is the first version of this work. Any potential mistake belongs to the first author.], we examine to what extent latent features can be inferred from the observable links in the network, considering network models which rely on spherical, hyperbolic and lattice geometries. For each geometry, we describe a latent network model, detail constraints on the latent coordinates which remove the well-known identifiability issues, and present schemes for Bayesian estimation. Thus, we develop a computational procedures to perform inference for network models in which the properties of the underlying geometry play a vital role. Furthermore, we access the validity of those models with real data applications.
READ FULL TEXT