Finding missing edges and communities in incomplete networks

2011/09/30 by Bowen Yan, Steve Gregory
Computer Science · Physics and Astronomy · #Advanced Clustering Algorithms Research #Bayesian Modeling and Causal Inference #Complete information #Complex Network Analysis Techniques #Enhanced Data Rates for GSM Evolution #Filling-in #Focus (optics) #Missing data #cs.SI #physics.data-an #physics.soc-ph

paper · pdf · doi:10.1088/1751-8113/44/49/495102

published as J. Phys. A: Math. Theor. 44 (2011) 495102 · 15 pages, 9 figures

openalex publication_date 2011/11/17 · arxiv created 2011/11/20 · arxiv updated 2011/11/22 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/06

Abstract

Many algorithms have been proposed for predicting missing edges in networks, but they do not usually take account of which edges are missing. We focus on networks which have missing edges of the form that is likely to occur in real networks, and compare algorithms that find these missing edges. We also investigate the effect of this kind of missing data on community detection algorithms.

Citations

• Missing and spurious interactions and the reconstruction of complex networks
• A New Status Index Derived from Sociometric Analysis
• Vertex similarity in networks
• Error and attack tolerance of complex networks
• THE DISTRIBUTION OF THE FLORA IN THE ALPINE ZONE.1
• The large-scale organization of metabolic networks
• Evolution of the social network of scientific collaborations
• Friends and neighbors on the Web
• The meaning and use of the area under a receiver operating characteristic (ROC) curve.
• An introduction to ROC analysis
• Two algorithms for computing regular equivalence