REVIEW 2 cited by
Latent Space Network Modelling with Hyperbolic and Spherical Geometries
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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 network analysis 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, we examine to what extent latent features can be inferred from the observable links in the network, considering network models which rely on spherical and hyperbolic geometries. For each geometry, we describe a latent space network model, detail constraints on the latent coordinates which remove the well-known identifiability issues, and present Bayesian estimation schemes. Thus, we develop computational procedures to perform inference for network models in which the properties of the underlying geometry play a vital role. Finally, we assess the validity of these models on real data.
Forward citations
Cited by 2 Pith papers
-
Latent space models for networks with nodal multiplicative effects
Nodal multiplicative distance scaling improves generative flexibility and structural fit of latent space network models.
-
Generating social networks with static and dynamic utility-maximization approaches
A utility-maximization framework with dot-product compatibilities that can regenerate any undirected graph and generate similar synthetic networks via agent-based simulations.
Discussion (0). Continue with ORCID to comment.