[4] Nir Ailon, Yudong Chen, and Huan Xu. Iterative and active graph clustering using trace norm minimization without cluster size constraints. J. Mach. Learn. Res., 16:455-490, 2015.
[5] Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation clustering. Machine learning, 56(1-3):89-113, 2004.
[6] Béla Bollobás and Alex D Scott. Max cut for random graphs with a planted partition. Combinatorics Probability and Computing, 13(4-5):451-474, 2004.
[7] Ravi B Boppana. Eigenvalues and graph bisection: An average-case analysis. In 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pages 280-285. IEEE, 1987.
[8] Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, and Michael Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7(2):171-191, 1987.
[9] Kamalika Chaudhuri, Fan Chung, and Alexander Tsiatas. Spectral clustering of graphs with general degrees in the extended planted partition model. In Conference on Learning Theory, pages 35-1. JMLR Workshop and Conference Proceedings, 2012.
[10] Yudong Chen, Sujay Sanghavi, and Huan Xu. Clustering sparse graphs. In Proceedings of the 25th International Conference on Neural Information Processing Systems-Volume 2, pages 2204–2212, 2012.
[11] Sam Cole. Recovering nonuniform planted partitions via iterated projection. Linear Algebra and its Applications, 576(1):79-107, 2019.
[12] Sam Cole, Shmuel Friedland, and Lev Reyzin. A simple spectral algorithm for recovering planted partitions. *Special Matrices*, 5(1):139-157, 2017.
[13] Chandler Davis and William M Kahan. Some new bounds on perturbation of subspaces. Bulletin of the American Mathematical Society, 75(4):863-868, 1969.
[14] Alberto Del Pia, Mingchen Ma, and Christos Tzamos. Clustering with queries under semirandom noise. arXiv preprint arXiv:2206.04583. To appear at Conference on Learning Theory (COLT) 2022, 2022.
[15] Martin E. Dyer and Alan M. Frieze. The solution of some random np-hard problems in polynomial expected time. Journal of Algorithms, 10(4):451-489, 1989.
[16] Ivan P Fellegi and Alan B Sunter. A theory for record linkage. Journal of the American Statistical Association, 64(328):1183-1210, 1969.
[17] Sally A Goldman, Michael J Kearns, and Robert E Schapire. Exact identification of circuits using fixed points of amplification functions. In Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pages 193-202. IEEE, 1990.
[18] Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
[19] Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt. Stochastic blockmodels: First steps. Social networks, 5(2):109-137, 1983.
[20] Zengfeng Huang Jinghui Xia. Optimal clustering with noisy queries via multi-armed bandit. To appear at the 39th International Conference on Machine Learning (ICML 2022), 2022.
[21] Kasper Green Larsen, Michael Mitzenmacher, and Charalampos Tsourakakis. Clustering with a faulty oracle. In Proceedings of The Web Conference 2020, pages 2831-2834, 2020.
[22] Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. Predicting positive and negative links in online social networks. In Proceedings of the 19th international conference on World wide web, pages 641-650, 2010.
[23] Arya Mazumdar and Barna Saha. Clustering with noisy queries. In Advances in Neural Information Processing Systems, pages 5788-5799, 2017.