Graphon Estimation from Partially Observed Network Data
arXiv:1906.00494
Abstract
We consider estimating the edge-probability matrix of a network generated from a graphon model when the full network is not observed---only some overlapping subgraphs are. We extend the neighbourhood smoothing (NBS) algorithm of Zhang et al. (2017) to this missing-data set-up and show experimentally that, for a wide range of graphons, the extended NBS algorithm achieves significantly smaller error rates than standard graphon estimation algorithms such as vanilla neighbourhood smoothing (NBS), universal singular value thresholding (USVT), blockmodel approximation, matrix completion, etc. We also show that the extended NBS algorithm is much more robust to missing data.
arXiv comment12 pages, 7 figures, 1 table
References in corpus (6)
- Link Prediction in Complex Networks: A Survey
- Matrix estimation by Universal Singular Value Thresholding
- Rate-optimal graphon estimation
- A Consistent Histogram Estimator for Exchangeable Graph Models
- Link prediction for egocentrically sampled networks
- Maximum Likelihood Estimation of Sparse Networks with Missing Observations