On estimation and inference in latent structure random graphs

06/04/2018
by   Avanti Athreya, et al.
0

We define a latent structure model (LSM) random graph as a random dot product graph (RDPG) in which the latent position distribution incorporates both probabilistic and geometric constraints, delineated by a family of underlying distributions on some fixed Euclidean space, and a structural support submanifold from which the latent positions for the graph are drawn. For a one-dimensional latent structure model with known structural support, we show how spectral estimates of the latent positions of an RDPG can be used for efficient estimation of the paramaters of the LSM. We describe how to estimate or learn the structural support in cases where it is unknown, with an illustrative focus on graphs with latent positions along the Hardy-Weinberg curve. Finally, we use the latent structure model formulation to test bilateral homology in the Drosophila connectome.

READ FULL TEXT

page 19

page 25

research
04/15/2020

Learning 1-Dimensional Submanifolds for Subsequent Inference on Random Dot Product Graphs

A random dot product graph (RDPG) is a generative model for networks in ...
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/20/2020

The multilayer random dot product graph

We present an extension of the latent position network model known as th...
research
11/07/2019

Improving Power of 2-Sample Random Graph Tests with Applications in Connectomics

In many applications, there is an interest in testing whether two graphs...
research
03/31/2020

On Two Distinct Sources of Nonidentifiability in Latent Position Random Graph Models

Two separate and distinct sources of nonidentifiability arise naturally ...
research
09/03/2018

Towards Dynamic Computation Graphs via Sparse Latent Structure

Deep NLP models benefit from underlying structures in the data---e.g., p...
research
07/29/2012

Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs

In this work we show that, using the eigen-decomposition of the adjacenc...

Please sign up or login with your details

Forgot password? Click here to reset