2,567
Views
34
CrossRef citations to date
0
Altmetric
Theory and Methods

Probabilistic Community Detection With Unknown Number of Communities

, &
Pages 893-905 | Received 01 Mar 2016, Published online: 11 Jul 2018

References

  • Abbe, E., and Sandon, C. (2015a), “Community Detection in the General Stochastic Block Model: Fundamental Limits and Efficient Algorithms for Recovery,” in Proceedings of 56th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, pp. 670–688.
  • ——— (2015b), “Detection in the Stochastic Block Model with Multiple Clusters: Proof of the Achievability Conjectures, Acyclic BP, and the Information-Computation Gap,” arXiv preprint arXiv:1512.09080.
  • ——— (2015c), “Recovering Communities in the General Stochastic Block Model without knowing the Parameters,” in Advances in Neural Information Processing Systems, Red Hook, NY: Curran Associates, Inc., pp. 676–684.
  • Airoldi, E. M., Blei, D. M., Fienberg, S. E., and Xing, E. P. (2008), “Mixed Membership Stochastic Blockmodels,” Journal of Machine Learning Research, 9, 1981–2014.
  • Aldous, D. J. (1985), Exchangeability and Related Topics, New York: Springer.
  • Amini, A. A., Chen, A., Bickel, P. J., and Levina, E. (2013), “Pseudo-Likelihood Methods for Community Detection in Large Sparse Networks,” The Annals of Statistics, 41, 2097–2122.
  • Bickel, P., and Chen, A. (2009), “A Nonparametric View of Network Models and Newman–Girvan and Other Modularities,” Proceedings of the National Academy of Sciences, 106, 21068–21073.
  • Blackwell, D., and MacQueen, J. B. (1973), “Ferguson Distributions via Pólya urn Schemes,” The Annals of Statistics, 1, 353–355.
  • Blondel, V. D., Guillaume, J.-L., Lambiotte, R., and Lefebvre, E. (2008), “Fast Unfolding of Communities in Large Networks,” Journal of Statistical Mechanics: Theory and Experiment, 2008, P10008.
  • Castillo, I., Schmidt-Hieber, J., and van der Vaart, A. W. (2015), “Bayesian Linear Regression with Sparse Priors,” The Annals of Statistics, 43, 1986–2018.
  • Dahl, D. B. (2009), “Modal Clustering in a Class of Product Partition Models,” Bayesian Analysis, 4, 243–264.
  • Daudin, J. J., Picard, F., and Robin, S. (2008), “A Mixture Model for Random Graphs,” Statistics and Computing, 18, 173–183.
  • Drton, M., and Plummer, M. (2017), “A Bayesian Information Criterion for Singular Models,” Journal of the Royal Statistical Society, Series B, 79, 323–380.
  • Gao, C., Ma, Z., Zhang, A. Y., and Zhou, H. H. (2017), “Achieving Optimal Misclassification Proportion in Stochastic Block Model,” The Journal of Machine Learning Research, 18, 1980–2024.
  • Goldenberg, A., Zheng, A., Fienberg, S., and Airoldi, E. (2010), “A Survey of Statistical Network Models,” Foundations and Trends® in Machine Learning, 2, 129–233.
  • Goldenberg, J., Libai, B., and Muller, E. (2001), “Talk of the Network: A Complex Systems look at the Underlying Process of Word-Of-Mouth,” Marketing Letters, 12, 211–223.
  • Green, P. J. (1995), “Reversible Jump Markov Chain Monte Carlo Computation and Bayesian Model Determination,” Biometrika, 82, 711–732.
  • Holland, P. W., Laskey, K. B., and Leinhardt, S. (1983), “Stochastic Blockmodels: First Steps,” Social Networks, 5, 109–137.
  • Johnson, V. E., and Rossell, D. (2012), “Bayesian Model Selection in High-Dimensional Settings,” Journal of the American Statistical Association, 107, 649–660.
  • Karrer, B., and Newman, M. E. J. (2011), “Stochastic Blockmodels and Community Structure in Networks,” Physical Review E, 83, 016107.
  • Kruijer, W., Rousseau, J., and Van Der Vaart, A. (2010), “Adaptive Bayesian Density Estimation with Location-Scale Mixtures,” Electronic Journal of Statistics, 4, 1225–1257.
  • Latouche, P., Birmele, E., and Ambroise, C. (2012), “Variational Bayesian Inference and Complexity Control for Stochastic Block Models,” Statistical Modelling, 12, 93–115.
  • Le, C. M., and Levina, E. (2015), “Estimating the Number of Communities in Networks by Spectral Methods,” arXiv:1507.00827.
  • Lusseau, D., and Newman, M. (2004), “Identifying the Role that Animals Play in their Social Networks,” Proceedings of the Royal Society of London B: Biological Sciences, 271, S477–S481.
  • Lusseau, D., Schneider, K., Boisseau, O., Haase, P., Slooten, E., and Dawson, S. (2003), “The Bottlenose Dolphin Community of Doubtful Sound features a Large Proportion of Long-Lasting Associations,” Behavioral Ecology and Sociobiology, 54, 396–405.
  • McDaid, A., Murphy, T. B., Friel, N., and Hurley, N. (2013), “Improved Bayesian inference for the Stochastic Block Model with Application to Large Networks,” Computational Statistics & Data Analysis, 60, 12–31.
  • Miller, J. W. (2014), “Nonparametric and Variable-Dimension Bayesian Mixture Models: Analysis, Comparison, and New Methods,” Ph.D. dissertation, Brown University, Providence, RI.
  • Miller, J. W., and Harrison, M. T. (2017), “Mixture Models with a Prior on the Number of Components,” Journal of the American Statistical Association, 113, 340–356.
  • Narisetty, N. N., He, X. (2014), “Bayesian Variable Selection with Shrinking and Diffusing Priors,” The Annals of Statistics, 42, 789–817.
  • Neal, R. M. (2000), “Markov Chain Sampling Methods for Dirichlet Process Mixture Models,” Journal of Computational and Graphical Statistics, 9, 249–265.
  • Newman, M. E. (2004), “Detecting Community Structure in Networks,” The European Physical Journal B-Condensed Matter and Complex Systems, 38, 321–330.
  • ——— (2006), “Finding Community Structure in Networks using the Eigenvectors of Matrices,” Physical review E, 74, 036104.
  • Newman, M. E. J. (2012), “Communities, Modules and Large-Scale Structure in Networks,” Nature Physics, 8, 25–31.
  • Newman, M. E., and Girvan, M. (2004), “Finding and Evaluating Community Structure in Networks,” Physical Review E, 69, 026113.
  • Newman, M., and Reinert, G. (2016), “Estimating the Number of Communities in a Network,” Physical Review Letters, 117, 078301.
  • Nobile, A., and Fearnside, A. T. (2007), “Bayesian Finite Mixtures with an Unknown Number of Components: The Allocation Sampler,” Statistics and Computing, 17, 147–162.
  • Nowicki, K., and Snijders, T. A. B. (2001), “Estimation and Prediction for Stochastic Blockstructures,” Journal of the American Statistical Association, 96, 1077–1087.
  • Pitman, J. (1995), “Exchangeable and Partially Exchangeable Random Partitions,” Probability Theory and Related Fields, 102, 145–158.
  • Rand, W. M. (1971), “Objective Criteria for the Evaluation of Clustering Methods,” Journal of the American Statistical Association, 66, 846–850.
  • Rohe, K., Chatterjee, S., and Yu, B. (2011), “Spectral Clustering and the High-Dimensional Stochastic Blockmodel,” The Annals of Statistics, 39, 1878–1915.
  • Rousseau, J., and Mengersen, K. (2011), “Asymptotic Behaviour of the Posterior Distribution in Overfitted Mixture Models,” Journal of the Royal Statistical Society, Series B, 73, 689–710.
  • Saldana, D. F., Yu, Y., and Feng, Y. (2015), “How Many Communities Are There?” Journal of Computational and Graphical Statistics, 26, 171–181.
  • Sethuraman, J. (1994), “A Constructive Definition of Dirichlet Priors,” Statistica Sinica, 4, 639–650.
  • Shi, J., and Malik, J. (2000), “Normalized Cuts and Image Segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888–905.
  • Shin, M., Bhattacharya, A., and Johnson, V. E. (2018), “Scalable Bayesian Variable Selection Using Nonlocal Prior Densities in Ultrahigh-Dimensional Settings,” Statistica Sinica, 28, 1053–1078.
  • Snijders, T. A. B., and Nowicki, K. (1997), “Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure,” Journal of classification, 14, 75–100.
  • Vershynin, R. (2012), “Introduction to the Non-Asymptotic Analysis of Random Matrices,” in Compressed Sensing: Theory and Applications, eds. Y. C. Eldar and G. Kutyniok, Cambridge, UK: Cambridge University Press.
  • Wang, Y. X., and Bickel, P. J. (2017), “Likelihood-Based Model Selection for Stochastic Block Models,” The Annals of Statistics, 45, 500–528.
  • White, S., and Smyth, P. (2005), “A Spectral Clustering Approach To Finding Communities in Graph,” in SDM (Vol. 5), SIAM, pp. 76–84.
  • Zanghi, H., Ambroise, C., and Miele, V. (2008), “Fast Online Graph Clustering via Erdős–Rényi mixture,” Pattern Recognition, 41, 3592–3599.
  • Zhang, A. Y., Zhou, H. H. (2016), “Minimax Rates of Community Detection in Stochastic Block Models,” The Annals of Statistics, 44, 2252–2280.
  • Zhang, S., Wang, R.-S., and Zhang, X.-S. (2007), “Identification of Overlapping Community Structure in Complex Networks using fuzzy c-Means Clustering,” Physica A: Statistical Mechanics and its Applications, 374, 483–490.
  • Zhao, Y., Levina, E., and Zhu, J. (2011), “Community Extraction for Social Networks,” Proceedings of the National Academy of Sciences, 108, 7321–7326.
  • ——— (2012), “Consistency of Community Detection in Networks Under Degree-Corrected Stochastic Block Models,” The Annals of Statistics, 40, 2266–2292.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.