{"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/parsimonious-module-inference-in-large","title":"Parsimonious module inference in large networks","arxiv_id":"1212.4794","date":"2012-12-19","proceeding":null,"authors":["Tiago P. Peixoto"],"abstract":"We investigate the detectability of modules in large networks when the number\nof modules is not known in advance. We employ the minimum description length\n(MDL) principle which seeks to minimize the total amount of information\nrequired to describe the network, and avoid overfitting. According to this\ncriterion, we obtain general bounds on the detectability of any prescribed\nblock structure, given the number of nodes and edges in the sampled network. We\nalso obtain that the maximum number of detectable blocks scales as $\\sqrt{N}$,\nwhere $N$ is the number of nodes in the network, for a fixed average degree\n$<k>$. We also show that the simplicity of the MDL approach yields an efficient\nmultilevel Monte Carlo inference algorithm with a complexity of $O(\\tau N\\log\nN)$, if the number of blocks is unknown, and $O(\\tau N)$ if it is known, where\n$\\tau$ is the mixing time of the Markov chain. We illustrate the application of\nthe method on a large network of actors and films with over $10^6$ edges, and a\ndissortative, bipartite block structure.","url_abs":"http://arxiv.org/abs/1212.4794v4","url_pdf":"http://arxiv.org/pdf/1212.4794v4.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":"parsimonious-module-inference-in-large","repo_url":"https://git.skewed.de/count0/graph-tool","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"mdl","method_name":"MDL"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1212.4794","atlas_url":"https://app.syntology.ai/?focus=1212.4794","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1212.4794"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1212.4794\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1212.4794"},"call":"get_concepts_for_paper(arxiv_id=\"1212.4794\")"}],"by_repo":[{"repo":"git.skewed.de/count0/graph-tool","kind":"official","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":"e7c6e1b6e9424d6568b77418a8f5ea10e16a09cf71b3cc6ab8d389e03b1319f8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}