期刊
PEERJ COMPUTER SCIENCE
卷 8, 期 -, 页码 -出版社
PEERJ INC
DOI: 10.7717/peerj-cs.10062/29
关键词
Stochastic block model; Graphon; Empirical Bayes; Networks
类别
资金
- NSF [DMS-1952929]
This work proposes a hierarchical model and develops a novel empirical Bayes estimate for the connectivity matrix of a stochastic block model to approximate the graphon function, introducing 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 the approach in terms of parameter estimation and model selection.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据