Maximum Likelihood Latent Space Embedding of Logistic Random Dot Product Graphs

10/03/2015
by   Luke O'Connor, et al.
0

A latent space model for a family of random graphs assigns real-valued vectors to nodes of the graph such that edge probabilities are determined by latent positions. Latent space models provide a natural statistical framework for graph visualizing and clustering. A latent space model of particular interest is the Random Dot Product Graph (RDPG), which can be fit using an efficient spectral method; however, this method is based on a heuristic that can fail, even in simple cases. Here, we consider a closely related latent space model, the Logistic RDPG, which uses a logistic link function to map from latent positions to edge likelihoods. Over this model, we show that asymptotically exact maximum likelihood inference of latent position vectors can be achieved using an efficient spectral method. Our method involves computing top eigenvectors of a normalized adjacency matrix and scaling eigenvectors using a regression step. The novel regression scaling step is an essential part of the proposed method. In simulations, we show that our proposed method is more accurate and more robust than common practices. We also show the effectiveness of our approach over standard real networks of the karate club and political blogs.

READ FULL TEXT

page 5

page 6

page 7

research
05/04/2023

Semisupervised regression in latent structure networks on unknown manifolds

Random graphs are increasingly becoming objects of interest for modeling...
research
07/25/2023

Gradient-Based Spectral Embeddings of Random Dot Product Graphs

The Random Dot Product Graph (RDPG) is a generative model for relational...
research
11/06/2017

Consistency of Maximum Likelihood for Continuous-Space Network Models

Network analysis needs tools to infer distributions over graphs of arbit...
research
09/16/2017

The generalised random dot product graph

This paper introduces a latent position network model, called the genera...
research
10/09/2018

Unsupervised Object Matching for Relational Data

We propose an unsupervised object matching method for relational data, w...
research
07/25/2019

Bootstrapping Networks with Latent Space Structure

A core problem in statistical network analysis is to develop network ana...
research
07/20/2017

Common and Individual Structure of Multiple Networks

This article focuses on the problem of studying shared- and individual-s...

Please sign up or login with your details

Forgot password? Click here to reset