Identification of influential invaders in evolutionary populations

摘要: The identification of the most influential nodes has been a vibrant subject research across whole network science. Here we map this problem to structured evolutionary populations, where strategies and interaction are both change over time based on social inheritance. We study cooperative communities, which cheaters can invade because they avoid cost contributions that associated with cooperation. question seek answer is at successfully. propose weighted degree decomposition identify rank invaders. More specifically, distinguish two kinds ranking decomposition. show strategy negative-weighted allows successfully invaders in case weak selection, while positive-weighted performs better when selection strong. Our thus reveals how statistical measures dynamically evolving communities.