Journal
PEERJ COMPUTER SCIENCE
Volume 8, Issue -, Pages -Publisher
PEERJ INC
DOI: 10.7717/peerj-cs.10062/29
Keywords
Stochastic block model; Graphon; Empirical Bayes; Networks
Categories
Funding
- NSF [DMS-1952929]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available