{"id":"https://openalex.org/W4415250919","doi":"https://doi.org/10.1109/hpec67600.2025.11196647","title":"Designing Parallel Algorithms for Community Detection using Arachne","display_name":"Designing Parallel Algorithms for Community Detection using Arachne","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4415250919","doi":"https://doi.org/10.1109/hpec67600.2025.11196647"},"language":"en","primary_location":{"id":"doi:10.1109/hpec67600.2025.11196647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","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/A5065481171","display_name":"Fuhuan Li","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fuhuan Li","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Data Science,Newark,New Jersey,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Data Science,Newark,New Jersey,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100685313","display_name":"Zhihui Du","orcid":"https://orcid.org/0000-0002-8435-1611"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhihui Du","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Data Science,Newark,New Jersey,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Data Science,Newark,New Jersey,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076610730","display_name":"David A. Bader","orcid":"https://orcid.org/0000-0002-7380-5876"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Bader","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Data Science,Newark,New Jersey,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Data Science,Newark,New Jersey,USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065481171"],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24407427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.6840999722480774,"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.6840999722480774,"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.5849000215530396,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/implementation","display_name":"Implementation","score":0.8208000063896179},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8105999827384949},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6155999898910522},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4823000133037567},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.460999995470047},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.4487000107765198},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.3734000027179718},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.3269999921321869}],"concepts":[{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.8208000063896179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8174999952316284},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8105999827384949},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6155999898910522},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5824000239372253},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4823000133037567},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.4487000107765198},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44029998779296875},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3449999988079071},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.3237000107765198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3212999999523163},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.2976999878883362},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2770000100135803},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2508000135421753},{"id":"https://openalex.org/C2776088427","wikidata":"https://www.wikidata.org/wiki/Q378859","display_name":"Pattern detection","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec67600.2025.11196647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1567553843","https://openalex.org/W2090409324","https://openalex.org/W2095293504","https://openalex.org/W2109726592","https://openalex.org/W2131681506","https://openalex.org/W2132022337","https://openalex.org/W2132202037","https://openalex.org/W2132958441","https://openalex.org/W2144662077","https://openalex.org/W2290805605","https://openalex.org/W2510781350","https://openalex.org/W2558632230","https://openalex.org/W2732636439","https://openalex.org/W2886462128","https://openalex.org/W2963794747","https://openalex.org/W2973738211","https://openalex.org/W2997087331","https://openalex.org/W3155056342","https://openalex.org/W3195993925","https://openalex.org/W3196292518","https://openalex.org/W4312246606","https://openalex.org/W4367147584","https://openalex.org/W4408974102","https://openalex.org/W4409131829","https://openalex.org/W4413145336"],"related_works":[],"abstract_inverted_index":{"The":[0],"rise":[1],"of":[2,23,38,87,105,121],"graph":[3,48],"data":[4],"in":[5],"various":[6],"fields":[7],"calls":[8],"for":[9,46],"efficient":[10,65],"and":[11,30,61,67,96,134],"scalable":[12],"community":[13,129],"detection":[14,130],"algorithms.":[15],"In":[16],"this":[17],"paper,":[18],"we":[19,101],"present":[20],"parallel":[21,71,123],"implementations":[22,51],"two":[24],"widely":[25],"used":[26],"algorithms:":[27],"Label":[28],"Propagation":[29],"Louvain,":[31],"specifically":[32],"designed":[33],"to":[34,89,117],"leverage":[35],"the":[36,103,122],"capabilities":[37],"Arachne,":[39,126],"which":[40,63],"is":[41,132],"a":[42],"Python-accessible":[43],"open-source":[44,133],"framework":[45],"large-scale":[47],"analysis.":[49],"Our":[50],"achieve":[52],"substantial":[53],"speedups":[54,86],"over":[55,91,94,98],"existing":[56],"Python-based":[57],"tools":[58],"like":[59],"NetworkX":[60],"igraph,":[62,95],"lack":[64],"parallelization,":[66],"are":[68],"competitive":[69],"with":[70],"frameworks":[72],"such":[73],"as":[74],"NetworKit.":[75,99],"Experimental":[76],"results":[77],"show":[78],"that":[79],"Arachne-based":[80],"methods":[81],"outperform":[82],"these":[83],"baselines,":[84],"achieving":[85],"up":[88],"710x":[90],"NetworkX,":[92],"75x":[93],"12x":[97],"Additionally,":[100],"analyze":[102],"scalability":[104],"our":[106,128],"implementation":[107],"under":[108],"varying":[109],"thread":[110],"counts,":[111],"demonstrating":[112],"how":[113],"different":[114],"phases":[115],"contribute":[116],"overall":[118],"performance":[119],"gains":[120],"Louvain":[124],"algorithm.":[125],"including":[127],"implementation,":[131],"available":[135],"at":[136],"https://github.com/Bears-R-Us/arkouda-njit.":[137]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-16T00:00:00"}