From which world is your graph?
arXiv:1711.00982
Abstract
Discovering statistical structure from links is a fundamental problem in the analysis of social networks. Choosing a misspecified model, or equivalently, an incorrect inference algorithm will result in an invalid analysis or even falsely uncover patterns that are in fact artifacts of the model. This work focuses on unifying two of the most widely used link-formation models: the stochastic blockmodel (SBM) and the small world (or latent space) model (SWM). Integrating techniques from kernel learning, spectral graph theory, and nonlinear dimensionality reduction, we develop the first statistically sound polynomial-time algorithm to discover latent patterns in sparse graphs for both models. When the network comes from an SBM, the algorithm outputs a block structure. When it is from an SWM, the algorithm outputs estimates of each node's latent position.
To appear in NIPS 2017
References in corpus (7)
- Near linear time algorithm to detect community structures in large-scale networks
- Matrix estimation by Universal Singular Value Thresholding
- Nonparametric graphon estimation
- Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
- Empirical Comparison of Algorithms for Network Community Detection
- Co-clustering separately exchangeable network data
- Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results