{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:36:57Z","timestamp":1743079017928,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030795269"},{"type":"electronic","value":"9783030795276"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79527-6_21","type":"book-chapter","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:43Z","timestamp":1624100623000},"page":"370-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Detection of Clusters of\u00a0Arbitrary Size"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6775-2045","authenticated-orcid":false,"given":"Bogdan-Adrian","family":"Manghiuc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"21_CR1","unstructured":"Allen-Zhu, Z., Lattanzi, S., Mirrokni, V.S.: A local algorithm for finding well-connected clusters. In: 30th International Conference on Machine Learning (ICML 2013), pp. 396\u2013404 (2013)"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Becchetti, L., Clementi, A.E.F., Manurangsi, P., Natale, E., Pasquale, F., Raghavendra, P., Trevisan, L.: Average whenever you meet: Opportunistic protocols for community detection. In: 26th European Symposium on Algorithms (ESA\u201918). LIPIcs, vol. 112, pp. 7:1\u20137:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.7","DOI":"10.4230\/LIPIcs.ESA.2018.7"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1137\/19M1243026","volume":"49","author":"L Becchetti","year":"2020","unstructured":"Becchetti, L., Clementi, A.E.F., Natale, E., Pasquale, F., Trevisan, L.: Find your place: simple distributed algorithms for community detection. SIAM J. Comput. 49(4), 821\u2013864 (2020). https:\/\/doi.org\/10.1137\/19M1243026","journal-title":"SIAM J. Comput."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2020.09.036","volume":"847","author":"L Becchetti","year":"2020","unstructured":"Becchetti, L., Cruciani, E., Pasquale, F., Rizzo, S.: Step-by-step community detection in volume-regular graphs. Theoret. Comput. Sci. 847, 49\u201367 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.09.036","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"SP Boyd","year":"2006","unstructured":"Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508\u20132530 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.874516","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Chang, Y., Saranurak, T.: Improved distributed expander decomposition and nearly optimal triangle enumeration. In: Robinson, P., Ellen, F. (eds.) Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, 29 July\u20132 August 2019, pp. 66\u201373. ACM (2019). https:\/\/doi.org\/10.1145\/3293611.3331618","DOI":"10.1145\/3293611.3331618"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Chang, Y., Saranurak, T.: Deterministic distributed expander decomposition and routing with applications in distributed derandomization. In: 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2020), pp. 377\u2013388. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00043","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"21_CR8","unstructured":"Chen, J., Sun, H., Woodruff, D.P., Zhang, Q.: Communication-optimal distributed clustering. In: Lee, D.D., Sugiyama, M., von Luxburg, U., Guyon, I., Garnett, R. (eds.) 29th Advances in Neural Information Processing Systems (NeurIPS 2016), pp. 3720\u20133728 (2016)"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Czumaj, A., Peng, P., Sohler, C.: Testing cluster structure of graphs. In: 47th Annual ACM Symposium on Theory of Computing (STOC 2015), pp. 723\u2013732. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746618","DOI":"10.1145\/2746539.2746618"},{"issue":"3\u20135","key":"21_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"21_CR11","unstructured":"Georgakopoulos, A., Haslegrave, J., Sauerwald, T., Sylvester, J.: The power of two choices for random walks. arXiv preprint arXiv:1911.05170 (2019)"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Hui, P., Yoneki, E., Chan, S.Y., Crowcroft, J.: Distributed community detection in delay tolerant networks. In: Proceedings of 2nd ACM\/IEEE International Workshop on Mobility in the Evolving Internet Architecture. Association for Computing Machinery (2007). https:\/\/doi.org\/10.1145\/1366919.1366929","DOI":"10.1145\/1366919.1366929"},{"key":"21_CR13","unstructured":"Laenen, S., Sun, H.: Higher-order spectral clustering of directed graphs. In: 33rd Advances in Neural Information Processing Systems (NeurIPS 2020) (2020)"},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Lee, J.R., Gharan, S.O., Trevisan, L.: Multiway spectral partitioning and higher-order Cheeger inequalities. J. ACM 61(6), 37:1\u201337:30 (2014). https:\/\/doi.org\/10.1145\/2665063","DOI":"10.1145\/2665063"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/15427951.2011.566458","volume":"7","author":"A Li","year":"2011","unstructured":"Li, A., Peng, P.: Community structures in classical network models. Internet Math. 7(2), 81\u2013106 (2011). https:\/\/doi.org\/10.1080\/15427951.2011.566458","journal-title":"Internet Math."},{"issue":"4","key":"21_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007). https:\/\/doi.org\/10.1007\/s11222-007-9033-z","journal-title":"Stat. Comput."},{"key":"21_CR17","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: 14th Advances in Neural Information Processing Systems (NeurIPS 2021), pp. 849\u2013856. MIT Press (2001)"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Oveis Gharan, S., Trevisan, L.: Partitioning into expanders. In: 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 1256\u20131266. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.93","DOI":"10.1137\/1.9781611973402.93"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/15M1047209","volume":"46","author":"R Peng","year":"2017","unstructured":"Peng, R., Sun, H., Zanetti, L.: Partitioning well-clustered graphs: spectral clustering works!. SIAM J. Comput. 46(2), 710\u2013743 (2017). https:\/\/doi.org\/10.1137\/15M1047209","journal-title":"SIAM J. Comput."},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Sauerwald, T., Zanetti, L.: Random walks on dynamic graphs: mixing times, hitting times, and return probabilities. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). LIPIcs, vol. 132, pp. 93:1\u201393:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.93","DOI":"10.4230\/LIPIcs.ICALP.2019.93"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). https:\/\/doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Comput. Sci. Rev."},{"issue":"8","key":"21_CR22","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000). https:\/\/doi.org\/10.1109\/34.868688","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Sun, H., Zanetti, L.: Distributed graph clustering and sparsification. ACM Trans. Parallel Comput. 6(3), 17:1\u201317:23 (2019). https:\/\/doi.org\/10.1145\/3364208","DOI":"10.1145\/3364208"},{"key":"21_CR24","unstructured":"Yang, W., Xu, H.: A divide and conquer framework for distributed graph clustering. In: 32nd International Conference on Machine Learning (ICML 2015). JMLR Workshop and Conference Proceedings, vol. 37, pp. 504\u2013513 (2015). JMLR.org"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79527-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:05:45Z","timestamp":1624100745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79527-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030795269","9783030795276"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79527-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2021.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}