• Corpus ID: 209325023

Latent Space Modelling of Hypergraph Data

  title={Latent Space Modelling of Hypergraph Data},
  author={Kathryn Turnbull and Sim'on Lunag'omez and Christopher Nemeth and Edoardo M. Airoldi},
  journal={arXiv: Methodology},
The increasing prevalence of relational data describing interactions among a target population has motivated a wide literature on statistical network analysis. In many applications, interactions may involve more than two members of the population and this data is more appropriately represented by a hypergraph. In this paper, we present a model for hypergraph data which extends the latent space distance model of Hoff et al. (2002) and, by drawing a connection to constructs from computational… 
Gaussian Processes on Hypergraphs
The utility of this framework on three challenging real-world problems that concern multi-class classification for the political party affiliation of legislators on the basis of voting behaviour, probabilistic matrix factorisation of movie reviews, and embedding a hypergraph of animals into a low-dimensional latent space are demonstrated.
Latent Space Network Modelling with Continuous and Discrete Geometries
To what extent latent features can be inferred from the observable links in the network is examined, considering network models which rely on spherical, hyperbolic and lattice geometries and develops a computational procedures to perform inference.
Latent Space Network Modelling with Hyperbolic and Spherical Geometries
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 is examined and computational procedures to perform inference are developed.
Higher-Order Relations Skew Link Prediction in Graphs
Surprisingly, it is found that Common Neighbors works very well, and even better in the presence of higher-order relations, but this is due to the CN-heuristic overestimating its prediction abilities in the Presence of Higher-order Relations.


Fast Inference for the Latent Space Network Model Using a Case-Control Approximate Likelihood
  • A. Raftery, Xiaoyue Niu, Peter D. Hoff, K. Y. Yeung
  • Computer Science
    Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America
  • 2012
A case-control log-likelihood is constructed, which is an unbiased estimator of the log-full likelihood of the latent space model, and is fitted to a large protein–protein interaction data using the case- control likelihood and used to identify false positive links.
Computationally efficient inference for latent position network models
This paper proposes a new method characterised by a linear computational complexity, which can be used to fit latent position models on networks of several tens of thousands nodes and establishes several theoretical results that show how the likelihood error propagates to the invariant distribution of the Markov chain Monte Carlo sampler.
Latent Surface Models for Networks Using Aggregated Relational Data
A latent surface representation of social network structure for partially observed network data is introduced and a multivariate measure of expected (latent) distance between an observed actor and unobserved actors with given features is derived.
Geometric Representations of Random Hypergraphs
A novel parameterization of distributions on hypergraphs based on the geometry of points in , which leads to new Metropolis-Hastings Markov chain Monte Carlo algorithms with both local and global moves in graph space and generally offers greater control on the distribution of graph features than currently possible.
Latent Space Approaches to Social Network Analysis
This work develops a class of models where the probability of a relation between actors depends on the positions of individuals in an unobserved “social space,” and proposes Markov chain Monte Carlo procedures for making inference on latent positions and the effects of observed covariates.
This work departs from previous work in this area by representing dependence structure between network views through a multivariate Bernoulli likelihood, providing a representation of between-view association and infers correlations between views not explained by the latent space model.
Dynamic social network analysis using latent space models
This paper generalizes a successful static model of relationships into a dynamic model that accounts for friendships drifting over time and shows how to make it tractable to learn such models from data, even as the number of entities n gets large.
Projective Sparse Latent Space Network Models
This work proposes an adjustment to latent-space network models which allows the number edges to scale linearly with the number of nodes, to scale quadratically, or at any intermediate rate.
Projective, Sparse, and Learnable Latent Position Network Models
This work proposes an alternative assumption---that the latent positions are generated according to a Poisson point process---and shows that it is compatible with various levels of sparsity, thus ensuring consistency of statistical inference across networks of different sizes.
Properties of latent variable network models
The Gaussian latent position model with random effects is introduced, and it is shown that it can represent the heavy-tailed degree distributions, positive asymptotic clustering coefficients, and small-world behaviors that often occur in observed social networks.