Similar articles

Abstract: Online social networks have attracted great attention recently, because they make it easy to build social connections for people all over the world. However, the observed structure of an online social network is always the aggregation of multiple social relationships. Thus, it is of great importance for real-world networks to reconstruct the full network structure using limited observations. The multiplex stochastic block model is introduced to describe multiple social ties, where different layers correspond to different attributes (e.g., age and gender of users in a social network). In this letter, we aim to improve the model precision using maximum likelihood estimation, where the precision is defined by the cross entropy of parameters between the data and model. Within this framework, the layers and partitions of nodes in a multiplex network are determined by natural node annotations, and the aggregate of the multiplex network is available. Because the original multiplex network has a high degree of freedom, we add an independent functional layer to cover it, and theoretically provide the optimal block number of the added layer. Empirical results verify the effectiveness of the proposed method using four measures, i.e., error of link probability, cross entropy, area under the receiver operating characteristic curve, and Bayes factor.

基于多层网络随机块模型的多重社交关系量化方法

[1]Barbillon P, Donnet S, Lazega E, et al., 2017. Stochastic block models for multiplex networks: an application to a multilevel network of researchers. J R Stat Soc Ser A, 180(1):295-314.

[2]Burg JP, 1972. The relationship between maximum entropy spectra and maximum likelihood spectra. Geophysics, 37(2):375-376.

[3]Chen JM, Hu K, Wang Q, et al., 2017. Narrowband Internet of Things: implementations and applications. IEEE Intern Things J, 4(6):2309-2314.

[4]Holland PW, Laskey KB, Leinhardt S, 1983. Stochastic blockmodels: first steps. Soc Netw, 5(2):109-137.

[5]Lacasa L, Mariño IP, Miguez J, et al., 2018. Multiplex decomposition of non-Markovian dynamics and the hidden layer reconstruction problem. Phys Rev X, 8(3):031038.

[6]Leskovec J, Krevl A, 2016. SNAP datasets: Stanford large network dataset collection. http://snap.stanford.edu/data

[7]Newman ME, Clauset A, 2016. Structure and inference in annotated networks. Nat Commun, 7:11863.

[8]Storey JD, 2003. The positive false discovery rate: a Bayesian interpretation and the q-value. Ann Stat, 31(6):2013-2035.

[9]Sun YZ, Han JW, 2012. Mining heterogeneous information networks: principles and methodologies. Synth Lect Data Min Knowl Discov, 3(2):1-159.

[10]Vall‘es-Catal‘a T, Massucci FA, Guimer‘a R, et al., 2016. Multilayer stochastic block models reveal the multilayer structure of complex networks. Phys Rev X, 6(1):011036.

[11]Zhou CW, Gu YJ, He SB, et al., 2018. A robust and efficient algorithm for coprime array adaptive beamforming. IEEE Trans Veh Technol, 67(2):1099-1112.