[1] Emmanuel Abbe. Community detection and stochastic block models: recent developments. The Journal of Machine Learning Research, 18(1):6446-6531, 2017.
[2] Emmanuel Abbe, Jianqing Fan, and Kaizheng Wang. An  $\ell_p$  theory of pca and spectral clustering. The Annals of Statistics, 50(4):2359-2385, 2022.
[3] Emmanuel Abbe and Colin Sandon. Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pages 670-688, Los Alamitos, CA, USA, 2015. IEEE Computer Society.
[4] Konstantin Avrachenkov and Maximilien Dreveton. Statistical Analysis of Networks. Now Publishers, 2022.
[5] Konstantin Avrachenkov, Maximilien Dreveton, and Lasse Leskelä. Community recovery in non-binary and temporal stochastic block models. arXiv preprint arXiv:2008.04790, 2022.
[6] Arindam Banerjee, Srujana Merugu, Inderjit S Dhillon, Joydeep Ghosh, and John Lafferty. Clustering with Bregman divergences. Journal of machine learning research, 6(10), 2005.
[7] Norbert Binkiewicz, Joshua T Vogelstein, and Karl Rohe. Covariate-assisted spectral clustering. Biometrika, 104(2):361-377, 2017.
[8] Guillaume Braun, Hemant Tyagi, and Christophe Biernacki. An iterative clustering algorithm for the contextual stochastic block model with optimality guarantees. In International Conference on Machine Learning, pages 2257-2291. PMLR, 2022.
[9] Andressa Cerqueira and Elizaveta Levina. A pseudo-likelihood approach to community detection in weighted networks. arXiv preprint arXiv:2303.05909, 2023.
[10] Narasinga Rao Chaganty and Jayaram Sethuraman. Strong large deviation and local limit theorems. The Annals of Probability, pages 1671-1690, 1993.
[11] Xiaohui Chen and Yun Yang. Cutoff for exact recovery of Gaussian mixture models. IEEE Transactions on Information Theory, 67(6):4223-4238, 2021.
[12] Herman Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, pages 493-507, 1952.
[13] Michael Collins, Sanjoy Dasgupta, and Robert E Schapire. A generalization of principal components analysis to the exponential family. Advances in neural information processing systems, 14, 2001.
[14] David Combe, Christine Largeron, Mathias Géry, and Elód Egyed-Zsigmond. I-Louvain: An attributed graph clustering method. In Advances in Intelligent Data Analysis XIV: 14th International Symposium, IDA 2015, Saint Etienne. France, October 22-24, 2015. Proceedings 14, pages 181-192. Springer, 2015.
[15] Yash Deshpande, Subhabrata Sen, Andrea Montanari, and Elchanan Mossel. Contextual stochastic block models. Advances in Neural Information Processing Systems, 31, 2018.
[16] Issam Falih, Nistor Grozavu, Rushed Kanawati, and Younès Bennani. Community detection in attributed network. In Companion proceedings of the web conference 2018, pages 1299-1306, 2018.
[17] Cees M Fortuin, Pieter W Kasteleyn, and Jean Ginibre. Correlation inequalities on some partially ordered sets. Communications in Mathematical Physics, 22:89-103, 1971.
[18] Santo Fortunato and Darko Hric. Community detection in networks: A user guide. Physics reports, 659:1-44, 2016.
[19] Geoffrey Grimmett. Percolation. Springer, 1999.
[20] Theodore E. Harris. A lower bound for the critical probability in a certain percolation process. In Mathematical Proceedings of the Cambridge Philosophical Society, volume 56, pages 13-20. Cambridge University Press, 1960.
[21] Lawrence Hubert and Phipps Arabie. Comparing partitions. Journal of classification, 2:193-218, 1985.
[22] Varun Jog and Po-Ling Loh. Recovering communities in weighted stochastic block models. In Proceedings of the 53rd Annual Allerton Conference on Communication, Control, and Computing, Los Alamitos, CA, USA, October 2015. IEEE Computer Society.