Projective, Sparse, and Learnable Latent Position Network Models

Abstract

When modeling network data using a latent position model, it is typical to assume that the nodes' positions are independently and identically distributed. However, this assumption implies the average node degree grows linearly with the number of nodes, which is inappropriate when the graph is thought to be sparse. We propose an alternative assumption -- that the latent positions are generated according to a Poisson point process -- and show that it is compatible with various levels of sparsity. Unlike other notions of sparse latent position models in the literature, our framework also defines a projective sequence of probability models, thus ensuring consistency of statistical inference across networks of different sizes. We establish conditions for consistent estimation of the latent positions, and compare our results to existing frameworks for modeling sparse networks.

arXiv comment70 pages, 2 figures

References in corpus (12)

• The structure and function of complex networks
• The phase transition in inhomogeneous random graphs
• Matrix estimation by Universal Singular Value Thresholding
• Graph limits and exchangeable random graphs
• Sparse graphs using exchangeable random measures
• Consistency under sampling of exponential random graph models
• Sparse exchangeable graphs and their limits via graphon processes
• The Class of Random Graphs Arising from Exchangeable Random Measures
• A framework for statistical network modeling
• Duality between equilibrium and growing networks
• Sparse power-law network model for reliable statistical predictions based on sampled data
• The Sparse Latent Position Model for nonnegative weighted networks

Cited by in corpus (1)

• Sparse power-law network model for reliable statistical predictions based on sampled data