The geometry of continuous latent space models for network data

Anna L. Smith, Dena M. Asta, Catherine A. Calder

Research output: Contribution to journalArticlepeer-review

39 Scopus citations

Abstract

We review the class of continuous latent space (statistical) models for network data, paying particular attention to the role of the geometry of the latent space. In these models, the presence/absence of network dyadic ties are assumed to be conditionally independent given the dyads' unobserved positions in a latent space. In this way, these models provide a probabilistic framework for embedding network nodes in a continuous space equipped with a geometry that facilitates the description of dependence between random dyadic ties. Specifically, these models naturally capture homophilous tendencies and triadic clustering, among other common properties of observed networks. In addition to reviewing the literature on continuous latent space models from a geometric perspective, we highlight the important role the geometry of the latent space plays on properties of networks arising from these models via intuition and simulation. Finally, we discuss results from spectral graph theory that allow us to explore the role of the geometry of the latent space, independent of network size. We conclude with conjectures about how these results might be used to infer the appropriate latent space geometry from observed networks.

Original languageEnglish
Pages (from-to)428-453
Number of pages26
JournalStatistical Science
Volume34
Issue number3
DOIs
StatePublished - Aug 1 2019

Bibliographical note

Publisher Copyright:
© Institute of Mathematical Statistics, 2019.

Keywords

  • Geometric curvature
  • Graph Laplacian
  • Latent variable
  • Network model

ASJC Scopus subject areas

  • Statistics and Probability
  • General Mathematics
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'The geometry of continuous latent space models for network data'. Together they form a unique fingerprint.

Cite this