{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/fast-unfolding-of-communities-in-large","title":"Fast unfolding of communities in large networks","arxiv_id":"0803.0476","date":"2008-03-04","proceeding":null,"authors":["Vincent D. Blondel","Jean-Loup Guillaume","Renaud Lambiotte","Etienne Lefebvre"],"abstract":"We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection method in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2.6 million customers and by analyzing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad-hoc modular networks. .","url_abs":"http://arxiv.org/abs/0803.0476v2","url_pdf":"http://arxiv.org/pdf/0803.0476v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/AO33/communityStructure_louvainMethod","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/CWTSLeiden/networkanalysis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/Daddeee/fast-bc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/SimonTommerup/02805-sgai","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/Sotera/distributed-louvain-modularity","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/TanemuraKiyoto/AutoGraph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/ZhihaoDC/TFG","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/aamend/texata-r2-2017","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/adityat/fastconsensus","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/eleurent/twitter-graph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/ledyba/cpp-louvain-fast","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/ledyba/go-louvain","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/liweivaio/Fast-Unfolding-Algorithm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/multivacplatform/louvain","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/nicolasdugue/DirectedLouvain","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/niteshjindal170988/workflow-docs-search","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/niteshjindal170988/workflow-docs-search--word-embeddings","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/pierre-crucifix/RealSpanish","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/leiden-communities-openmp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/leiden-communities-openmp-dynamic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/leiden-communities-openmp-heuristic-dynamic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/leiden-lowmem-communities-openmp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/louvain-communities-cuda","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/louvain-communities-openmp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/louvain-communities-openmp-dynamic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/louvain-lowmem-communities-openmp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/louvain-split-communities-openmp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/puzzlef/rak-lowmem-communities-openmp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/rio26/community-detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-unfolding-of-communities-in-large","repo_url":"https://github.com/shobrook/communities","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/0803.0476","atlas_url":"https://app.syntology.ai/?focus=0803.0476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0803.0476"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Sotera/distributed-louvain-modularity","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ledyba/go-louvain","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/niteshjindal170988/workflow-docs-search","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/eleurent/twitter-graph","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ZhihaoDC/TFG","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/TanemuraKiyoto/AutoGraph","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/leiden-communities-openmp","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/leiden-communities-openmp-dynamic","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/louvain-communities-openmp","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/louvain-communities-openmp-dynamic","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/multivacplatform/louvain","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/rio26/community-detection","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/leiden-lowmem-communities-openmp","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/aamend/texata-r2-2017","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/SimonTommerup/02805-sgai","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ledyba/cpp-louvain-fast","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/AO33/communityStructure_louvainMethod","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/louvain-split-communities-openmp","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/louvain-lowmem-communities-openmp","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nicolasdugue/DirectedLouvain","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/niteshjindal170988/workflow-docs-search--word-embeddings","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/liweivaio/Fast-Unfolding-Algorithm","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/rak-lowmem-communities-openmp","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/puzzlef/louvain-communities-cuda","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pierre-crucifix/RealSpanish","reach":{"status":"unanswered"}}],"summary":{"ran_draft_wrong":4,"ran_honours":1,"unverified":1},"by_repo_kind":{"listed":{"samples":6,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"3ec16b5044ac29e8","entry":"animation_data","repo":"shobrook/communities","repo_kind":"listed","path":"communities/algorithms/girvan_newman.py","file_url":"https://github.com/shobrook/communities/blob/HEAD/communities/algorithms/girvan_newman.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3ec16b5044ac29e8"}},{"code_sha256_prefix":"638070cebea66a0c","entry":"get_all_edges","repo":"shobrook/communities","repo_kind":"listed","path":"communities/algorithms/louvain_method.py","file_url":"https://github.com/shobrook/communities/blob/HEAD/communities/algorithms/louvain_method.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"638070cebea66a0c"}},{"code_sha256_prefix":"28ad853f0afe6c69","entry":"initialize_node_to_comm","repo":"shobrook/communities","repo_kind":"listed","path":"communities/algorithms/louvain_method.py","file_url":"https://github.com/shobrook/communities/blob/HEAD/communities/algorithms/louvain_method.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"28ad853f0afe6c69"}},{"code_sha256_prefix":"3d3c93947c899e96","entry":"invert_node_to_comm","repo":"shobrook/communities","repo_kind":"listed","path":"communities/algorithms/louvain_method.py","file_url":"https://github.com/shobrook/communities/blob/HEAD/communities/algorithms/louvain_method.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3d3c93947c899e96"}},{"code_sha256_prefix":"2481ea9230ba764c","entry":"prune_edges","repo":"shobrook/communities","repo_kind":"listed","path":"communities/algorithms/girvan_newman.py","file_url":"https://github.com/shobrook/communities/blob/HEAD/communities/algorithms/girvan_newman.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2481ea9230ba764c"}},{"code_sha256_prefix":"16f7a1dc609c07a8","entry":"girvan_newman","repo":"shobrook/communities","repo_kind":"listed","path":"communities/algorithms/girvan_newman.py","file_url":"https://github.com/shobrook/communities/blob/HEAD/communities/algorithms/girvan_newman.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"16f7a1dc609c07a8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}