{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/scalable-detection-of-statistically","title":"Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity","arxiv_id":"1403.5787","date":"2014-03-23","proceeding":null,"authors":["Pan Zhang","Cristopher Moore"],"abstract":"Modularity is a popular measure of community structure. However, maximizing\nthe modularity can lead to many competing partitions, with almost the same\nmodularity, that are poorly correlated with each other. It can also produce\nillusory \"communities\" in random graphs where none exist. We address this\nproblem by using the modularity as a Hamiltonian at finite temperature, and\nusing an efficient Belief Propagation algorithm to obtain the consensus of many\npartitions with high modularity, rather than looking for a single partition\nthat maximizes it. We show analytically and numerically that the proposed\nalgorithm works all the way down to the detectability transition in networks\ngenerated by the stochastic block model. It also performs well on real-world\nnetworks, revealing large communities in some networks where previous work has\nclaimed no communities exist. Finally we show that by applying our algorithm\nrecursively, subdividing communities until no statistically-significant\nsubcommunities can be found, we can detect hierarchical structure in real-world\nnetworks more efficiently than previous methods.","url_abs":"http://arxiv.org/abs/1403.5787v3","url_pdf":"http://arxiv.org/pdf/1403.5787v3.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":"abstracts"},"code_links":[{"paper_slug":"scalable-detection-of-statistically","repo_url":"https://github.com/bwalker1/ModularityBP_Cpp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"stochastic-block-model","task_name":"Stochastic Block Model"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"bwalker1/ModularityBP_Cpp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0198894b4a7ee5c14a356e66a5fa8a0977232f9bef79b0782478fff2a3dd4cf2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}