Corpus ID: 88516785

Projective, Sparse, and Learnable Latent Position Network Models

@article{Spencer2017ProjectiveSA,
  title={Projective, Sparse, and Learnable Latent Position Network Models},
  author={Neil A. Spencer and Cosma Rohilla Shalizi},
  journal={arXiv: Statistics Theory},
  year={2017}
}
  • Neil A. Spencer, Cosma Rohilla Shalizi
  • Published 2017
  • Mathematics
  • arXiv: Statistics Theory
  • 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… CONTINUE READING

    Figures from this paper.

    Faster MCMC for Gaussian Latent Position Network Models
    Advancements in latent space network modelling
    1
    Latent Space Representations of Hypergraphs
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 44 REFERENCES
    Properties of latent variable network models
    29
    Learnability of latent position network models
    1
    Bayesian nonparametrics for Sparse Dynamic Networks
    15
    Exploration of Large Networks via Fast and Universal Latent Space Model Fitting
    10
    Latent Space Approaches to Social Network Analysis
    1422
    Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs
    63