Finding missing edges and communities in incomplete networks
arXiv:1109.2215 · doi:10.1088/1751-8113/44/49/495102
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.
arXiv comment15 pages, 9 figures
References in corpus (20)
- Fast unfolding of communities in large networks
- Finding community structure in very large networks
- Error and attack tolerance of complex networks
- Cooperative Game Theory Approaches for Network Partitioning
- Hierarchical organization of modularity in metabolic networks
- The large-scale organization of metabolic networks
- Benchmark graphs for testing community detection algorithms
- Link Prediction in Complex Networks: A Survey
- Hierarchical structure and the prediction of missing links in networks
- Evolution of the social network of scientific collaborations
- Clustering and preferential attachment in growing networks
- Detecting the overlapping and hierarchical community structure of complex networks
- Predicting Missing Links via Local Information
- Self-similar community structure in organisations
- The Web of Human Sexual Contacts
- Vertex similarity in networks
- Missing and spurious interactions and the reconstruction of complex networks
- Finding overlapping communities in networks by label propagation
- Effective and Efficient Similarity Index for Link Prediction of Complex Networks
- Information filtering based on transferring similarity