{"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/close-spatial-arrangement-of-mutants-favors","title":"Close spatial arrangement of mutants favors and disfavors fixation","arxiv_id":"1811.08718","date":"2019-08-21","proceeding":null,"authors":[],"abstract":"Cooperation is ubiquitous across all levels of biological systems ranging\nfrom microbial communities to human societies. It, however, seemingly\ncontradicts the evolutionary theory, since cooperators are exploited by\nfree-riders and thus are disfavored by natural selection. Many studies based on\nevolutionary game theory have tried to solve the puzzle and figure out the\nreason why cooperation exists and how it emerges. Network reciprocity is one of\nthe mechanisms to promote cooperation, where nodes refer to individuals and\nlinks refer to social relationships. The spatial arrangement of mutant\nindividuals, which refers to the clustering of mutants, plays a key role in\nnetwork reciprocity. Besides, many other mechanisms supporting cooperation\nsuggest that the clustering of mutants plays an important role in the expansion\nof mutants. However, the clustering of mutants and the game dynamics are\ntypically coupled. It is still unclear how the clustering of mutants alone\nalters the evolutionary dynamics. To this end, we employ a minimal model with\nfrequency independent fitness on a circle. It disentangles the clustering of\nmutants from game dynamics. The distance between two mutants on the circle is\nadopted as a natural indicator for the clustering of mutants or assortment. We\nfind that the assortment is an amplifier of the selection for the connected\nmutants compared with the separated ones. Nevertheless, as mutants are\nseparated, the more dispersed mutants are, the greater the chance of invasion\nis. It gives rise to the non-monotonic effect of clustering, which is\ncounterintuitive. On the other hand, we find that less assortative mutants\nspeed up fixation. Our model shows that the clustering of mutants plays a\nnon-trivial role in fixation, which has emerged even if the game interaction is\nabsent.","url_abs":"http://arxiv.org/abs/1811.08718v2","url_pdf":"http://arxiv.org/pdf/1811.08718v2.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":"close-spatial-arrangement-of-mutants-favors","repo_url":"https://github.com/Awdrtgg/DB_on_cycle","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"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":"Awdrtgg/DB_on_cycle","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":"b06e8be85043d77b4747753c4353617b6380267ebc924f6b7628cf7759795cdd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}