{"id":"https://openalex.org/W4286210465","doi":"https://doi.org/10.1145/3519270.3538449","title":"A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees","display_name":"A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286210465","doi":"https://doi.org/10.1145/3519270.3538449"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538449","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research, Zurich, Switzerland","Google Research [Zurich] (Zurich - Switzerland)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]},{"raw_affiliation_string":"Google Research [Zurich] (Zurich - Switzerland)","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045186573","display_name":"Frederik Mallmann-Trenn","orcid":"https://orcid.org/0000-0003-0363-8547"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Frederik Mallmann-Trenn","raw_affiliation_strings":["King's Collge, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King's Collge, London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005657476","display_name":"David Saulpic","orcid":"https://orcid.org/0000-0003-4208-8541"},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"David Saulpic","raw_affiliation_strings":["LIP6, Sorbonne Universit\u00e9, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP6, Sorbonne Universit\u00e9, Paris, France","institution_ids":["https://openalex.org/I4210159731","https://openalex.org/I39804081"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1219,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.40414729,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":null,"first_page":"356","last_page":"365"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7933765649795532},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6554036140441895},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.6482498049736023},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.6473603248596191},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5249992609024048},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5139331221580505},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.488429456949234},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.476124107837677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37822067737579346},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2939433455467224},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2150086760520935},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14201155304908752}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7933765649795532},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6554036140441895},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.6482498049736023},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.6473603248596191},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5249992609024048},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5139331221580505},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.488429456949234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.476124107837677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37822067737579346},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2939433455467224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2150086760520935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14201155304908752},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3519270.3538449","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03944613v1","is_oa":false,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-03944613","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, Jul 2022, Salerno, Italy. pp.356-365, ⟨10.1145/3519270.3538449⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4484632653","display_name":null,"funder_award_id":"EP/W005573/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6297724363","display_name":"Algorithmic theory of new data models","funder_award_id":"ANR-19-CE48-0016","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2011843642","https://openalex.org/W2017588197","https://openalex.org/W2039307015","https://openalex.org/W2051586153","https://openalex.org/W2061099285","https://openalex.org/W2095293504","https://openalex.org/W2117526408","https://openalex.org/W2131681506","https://openalex.org/W2132202037","https://openalex.org/W2158343516","https://openalex.org/W2161455936","https://openalex.org/W2173213060","https://openalex.org/W2176844533","https://openalex.org/W2416738288","https://openalex.org/W2602671714","https://openalex.org/W2753908209","https://openalex.org/W2963264680","https://openalex.org/W2964294252","https://openalex.org/W2982458049","https://openalex.org/W6687322159","https://openalex.org/W6724612407"],"related_works":["https://openalex.org/W4230687177","https://openalex.org/W1968829728","https://openalex.org/W2349859869","https://openalex.org/W3120118008","https://openalex.org/W4316651471","https://openalex.org/W2051365847","https://openalex.org/W2367249529","https://openalex.org/W2027187261","https://openalex.org/W4297634341","https://openalex.org/W170159993"],"abstract_inverted_index":{"Graph":[0],"clustering":[1,46],"is":[2,56],"one":[3,39,49],"of":[4,17,40,52,79,109,118],"the":[5,14,18,20,34,41,53,84,95,99,121],"most":[6,42],"basic":[7],"and":[8,67,112],"popular":[9],"unsupervised":[10],"learning":[11],"problems.":[12],"Among":[13],"different":[15],"formulations":[16],"problem,":[19],"modularity":[21],"objective":[22],"has":[23,37],"been":[24],"particularly":[25],"successful":[26],"in":[27,64,83,98,104,128],"helping":[28],"design":[29],"impactful":[30],"algorithms;":[31],"Most":[32],"notably,":[33],"Louvain":[35,54,80,123],"algorithm":[36,44,55,124],"become":[38],"used":[43],"for":[45,114],"graphs.":[47],"However,":[48],"major":[50],"limitation":[51],"its":[57],"sequential":[58],"nature":[59],"which":[60,81],"makes":[61],"it":[62,93],"impractical":[63],"distributed":[65],"environments":[66],"on":[68],"massive":[69],"datasets.":[70],"In":[71],"this":[72],"paper,":[73],"we":[74],"provide":[75],"a":[76,106,115],"parallel":[77,86,110],"version":[78],"works":[82],"massively":[85],"computation":[87],"model":[88,103],"(MPC).":[89],"We":[90],"show":[91],"that":[92],"recovers":[94],"ground-truth":[96],"clusters":[97],"classic":[100],"stochastic":[101],"block":[102],"only":[105],"constant":[107],"number":[108],"rounds,":[111],"so":[113],"wider":[116],"regime":[117],"parameters":[119],"than":[120],"standard":[122],"as":[125],"shown":[126],"recently":[127],"[Cohen-Addad":[129],"et":[130],"al.":[131],"2020].":[132]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}