Degree-corrected stochastic block models and reliability in networks

Plenty of algorithms for link prediction have been proposed to extract missing information, identify spurious interactions, reconstruct networks, and so on. Stochastic block models are one of the most accurate methods among all of them. However, this algorithm is designed only for simple graphs and ignores the variation in node degree which is typically displayed in real-world networks. In this paper, we propose a corresponding reliable approach based on degree-corrected stochastic block models, which could be applied in networks containing both multi-edges and self-edges. Empirical comparison on five disparate networks shows that the overall performance of our method is better than the original version in predicting missing links, especially for the interactions between high-degree nodes.

[1]  Hui Tian,et al.  Hidden link prediction based on node centrality and weak ties , 2013 .

[2]  Gerard T. Barkema,et al.  Monte Carlo Methods in Statistical Physics , 1999 .

[3]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[4]  Gueorgi Kossinets Effects of missing data in social networks , 2006, Soc. Networks.

[5]  Giulio Cimini,et al.  Removing spurious interactions in complex networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[8]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[10]  Linyuan Lu,et al.  Uncovering missing links with cold ends , 2011, ArXiv.

[11]  Carter T. Butts,et al.  Network inference, error, and informant (in)accuracy: a Bayesian approach , 2003, Soc. Networks.

[12]  J. Schafer,et al.  Missing data: our view of the state of the art. , 2002, Psychological methods.

[13]  M. Newman Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Tao Zhou,et al.  Link prediction in weighted networks: The role of weak ties , 2010 .

[15]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[16]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[17]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[18]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  J. Hanley,et al.  The meaning and use of the area under a receiver operating characteristic (ROC) curve. , 1982, Radiology.

[20]  Zhen Liu,et al.  Link prediction in complex networks: A local naïve Bayes model , 2011, ArXiv.

[21]  Roger Guimerà,et al.  Missing and spurious interactions and the reconstruction of complex networks , 2009, Proceedings of the National Academy of Sciences.

[22]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[23]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[24]  P. Jaccard,et al.  Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .

[25]  Christos Faloutsos,et al.  Fast Random Walk with Restart and Its Applications , 2006, Sixth International Conference on Data Mining (ICDM'06).

[26]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[27]  Xiao Liang,et al.  Performance of local information-based link prediction: a sampling perspective , 2011, ArXiv.

[28]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[29]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.