Reducers of fixation for Birth--death and death--Birth updating on weighted graphs

Under Birth--death (Bd) updating, an individual chosen in proportion to fitness replaces a neighbor, whereas under death--Birth (dB) updating, a neighbor chosen in proportion to fitness replaces a uniformly chosen individual. A graph is a reducer of fixation if a mutant of any fitness $r\ne1$, started at a uniformly chosen vertex, replaces all residents with lower probability than in a well-mixed population. For mutants arising in offspring, reducers can raise steady-state mean fitness above that of graphs favoring beneficial and disfavoring deleterious mutants. No Bd reducer was known, because a reducer's fixation probability must be tangent to the well-mixed one at $r=1$, where the two are equal on every graph. Under dB updating, graphs with equal weighted degrees meet this condition, but whether all are reducers was open. Tuning one edge weight, we certify Bd reducers on every vertex count from $4$ to $40$, among them a four-cycle with a chord of weight $6$. Under dB updating, strongly deleterious mutants fix with higher probability than in a well-mixed population on every graph on at least four vertices except cycles and complete graphs, so cycles are the only unweighted reducers and equal weighted degrees do not suffice.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24369653
Primary Topic
Evolutionary Game Theory and Cooperation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Reducers of fixation for Birth--death and death--Birth updating on weighted graphs

Sungwoo Kang
Zenodo (CERN European Organization for Nuclear Research)
Evolutionary Game Theory and Cooperation
preprint

Reducers of fixation for Birth--death and death--Birth updating on weighted graphs

Sungwoo Kang
preprint en

Abstract

Under Birth--death (Bd) updating, an individual chosen in proportion to fitness replaces a neighbor, whereas under death--Birth (dB) updating, a neighbor chosen in proportion to fitness replaces a uniformly chosen individual. A graph is a reducer of fixation if a mutant of any fitness $r\ne1$, started at a uniformly chosen vertex, replaces all residents with lower probability than in a well-mixed population. For mutants arising in offspring, reducers can raise steady-state mean fitness above that of graphs favoring beneficial and disfavoring deleterious mutants. No Bd reducer was known, because a reducer's fixation probability must be tangent to the well-mixed one at $r=1$, where the two are equal on every graph. Under dB updating, graphs with equal weighted degrees meet this condition, but whether all are reducers was open. Tuning one edge weight, we certify Bd reducers on every vertex count from $4$ to $40$, among them a four-cycle with a chord of weight $6$. Under dB updating, strongly deleterious mutants fix with higher probability than in a well-mixed population on every graph on at least four vertices except cycles and complete graphs, so cycles are the only unweighted reducers and equal weighted degrees do not suffice.

Zenodo (CERN European Organization for Nuclear Research)
Evolutionary Game Theory and Cooperation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon