Protected domains and cooperative invasion on weighted networks
Abstract
Reciprocal contacts can favor cooperation by protecting a lineage until its descendants compete as a group. An individual is chosen to reproduce from the whole population, with a probability increasing with its averaged cooperation payoff. Its offspring replaces a neighbor through contacts weighted equally in both directions. We compare a single cooperator taking over defectors with the reverse invasion, using the same distribution of introduction sites. When payoffs weakly affect reproduction, every network with at least six sites and a path visiting them all admits weights favoring cooperation at any benefit-cost ratio b/c>1. This holds for mutants placed uniformly or arising in newborn offspring. Unequal contacts sustain aligned domains around two protected sites, converting individual reproduction into collective competition. Cooperation cannot have an advantage when its benefit does not exceed its cost, at any positive selection strength with positive reproduction rates. Where mutants arise changes which contact patterns can use this mechanism. On a five-site path, the weak-selection threshold has the sharp lower bound seven under uniform placement; newborn introduction never favors cooperation at this order. We classify the contact patterns with at most five sites that can favor cooperation under either rule; newborn introduction requires a four- or five-site cycle. Tracing copies backward to their ancestors separates domain competition from the probability of reaching it. Exact polynomial inequalities prove sharp threshold bounds for paths and the four- and five-site cycles. The same ancestry reconstructs evolution without selection on weighted paths and cycles and fixes the slowest relaxation rate on every connected reciprocal network. Cooperation thus depends on both the collective competitors created by contacts and the route by which a new lineage enters them.
Related
- The resource cost of cooperative invasion
- Effects of Ageratina adenophora invasion on soil multifunctionality and microbial networks of Pinus yunnanensis forest in the Panxi region, China
- Evaluation of object detection neural networks to find topologically associated domains in bulk Hi-C data
- Where to improve the European protected areas network to represent threatened fungi?
- Counterfactual effect of Colombian protected areas on multispecies functional connectivity
BibTeX
@misc{chowdhury2026protected,
title = {{Protected domains and cooperative invasion on weighted networks}},
author = {Abhishek Chowdhury},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.10463},
eprint = {2609.10463},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.10463},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Protected domains and cooperative invasion on weighted networks
AU - Abhishek Chowdhury
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2609.10463
UR - https://arxiv.org/abs/2609.10463
AB - Reciprocal contacts can favor cooperation by protecting a lineage until its descendants compete as a group. An individual is chosen to reproduce from the whole population, with a probability increasing with its averaged cooperation payoff. Its offspring replaces a neighbor through contacts weighted equally in both directions. We compare a single cooperator taking over defectors with the reverse invasion, using the same distribution of introduction sites. When payoffs weakly affect reproduction, every network with at least six sites and a path visiting them all admits weights favoring cooperation at any benefit-cost ratio b/c>1. This holds for mutants placed uniformly or arising in newborn offspring. Unequal contacts sustain aligned domains around two protected sites, converting individual reproduction into collective competition. Cooperation cannot have an advantage when its benefit does not exceed its cost, at any positive selection strength with positive reproduction rates. Where mutants arise changes which contact patterns can use this mechanism. On a five-site path, the weak-selection threshold has the sharp lower bound seven under uniform placement; newborn introduction never favors cooperation at this order. We classify the contact patterns with at most five sites that can favor cooperation under either rule; newborn introduction requires a four- or five-site cycle. Tracing copies backward to their ancestors separates domain competition from the probability of reaching it. Exact polynomial inequalities prove sharp threshold bounds for paths and the four- and five-site cycles. The same ancestry reconstructs evolution without selection on weighted paths and cycles and fixes the slowest relaxation rate on every connected reciprocal network. Cooperation thus depends on both the collective competitors created by contacts and the route by which a new lineage enters them.
ER -