mlsanityData to 7 Oct 2026

Fitting Low-rank Models on Egocentrically Sampled Partial Networks

arXiv 2303.11230 ↗First posted 9 Mar 2023cs.SI cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

The statistical modeling of random networks has been widely used to uncover interaction mechanisms in complex systems and to predict unobserved links in real-world networks. In many applications, network connections are collected via egocentric sampling: a subset of nodes is sampled first, after which all links involving this subset are recorded; all other information is missing. Compared with the assumption of ``uniformly missing at random", egocentrically sampled partial networks require specially designed modeling strategies. Current statistical methods are either computationally infeasible or based on intuitive designs without theoretical justification. Here, we propose an approach to fit general low-rank models for egocentrically sampled networks, which include several popular network models. This method is based on graph spectral properties and is computationally efficient for large-scale networks. It results in consistent recovery of missing subnetworks due to egocentric sampling for sparse networks. To our knowledge, this method offers the first theoretical guarantee for egocentric partial network estimation in the scope of low-rank models. We evaluate the technique on several synthetic and real-world networks and show that it delivers competitive performance in link prediction tasks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 59 references that are in the map. First posted on arXiv 9 Mar 2023.

Builds on

19 of 59 references.

References · 19

  1. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
  2. 2013Consistency of spectral clustering in stochastic block modelscited by 128
  3. 2017Statistical inference on random dot product graphs: a surveycited by 70
  4. 2017A statistical interpretation of spectral embedding: the generalised random dot product graphcited by 55
  5. 2019Stacking Models for Nearly Optimal Link Prediction in Complex Networkscited by 35
  6. 2020The impossibility of low rank representations for triangle-rich complex networkscited by 32
  7. 2015Estimating network edge probabilities by neighborhood smoothingcited by 28
  8. 2014Network Cross-Validation for Determining the Number of Communities in Network Datacited by 21
  9. 2018Hierarchical community detection by recursive partitioningcited by 16
  10. 2021Bayesian hierarchical stacking: Some models are (somewhere) usefulcited by 14
  11. 2018Reconstructing networks with unknown and heterogeneous errorscited by 11
  12. 2016On clustering network-valued datacited by 9
7 more
  1. 2018Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testingcited by 8
  2. 2020Linear regression and its inference on noisy network-linked datacited by 8
  3. 2013Link prediction for partially observed networkscited by 7
  4. 2021Consistent Spectral Clustering of Network Block Models under Local Differential Privacycited by 6
  5. 2018Link prediction for egocentrically sampled networkscited by 4
  6. 2021Network Estimation by Mixing: Adaptivity and Morecited by 4
  7. 2020On the Theoretical Properties of the Network Jackknifecited by 3

Built on by

Not cited yet.