Peng Zhanhao, Zhou Qing
Department of Statistics, University of California, Los Angeles, Los Angeles, California, United States of America.
PeerJ Comput Sci. 2022 Jul 6;8:e1006. doi: 10.7717/peerj-cs.1006. eCollection 2022.
The graphon (W-graph), including the stochastic block model as a special case, has been widely used in modeling and analyzing network data. Estimation of the graphon function has gained a lot of recent research interests. Most existing works focus on inference in the latent space of the model, while adopting simple maximum likelihood or Bayesian estimates for the graphon or connectivity parameters given the identified latent variables. In this work, we propose a hierarchical model and develop a novel empirical Bayes estimate of the connectivity matrix of a stochastic block model to approximate the graphon function. Based on our hierarchical model, we further introduce a new model selection criterion for choosing the number of communities. Numerical results on extensive simulations and two well-annotated social networks demonstrate the superiority of our approach in terms of parameter estimation and model selection.
图函数(W - 图),包括作为特殊情况的随机块模型,已被广泛用于网络数据的建模和分析。图函数的估计最近引起了很多研究兴趣。大多数现有工作专注于模型潜在空间中的推断,同时在给定已识别的潜在变量的情况下,对图函数或连通性参数采用简单的最大似然估计或贝叶斯估计。在这项工作中,我们提出了一种层次模型,并开发了一种新颖的经验贝叶斯估计方法来估计随机块模型的连通性矩阵,以逼近图函数。基于我们的层次模型,我们进一步引入了一种新的模型选择标准来选择社区数量。在广泛的模拟和两个标注良好的社交网络上的数值结果证明了我们的方法在参数估计和模型选择方面的优越性。