{'fraction_non_alphanumeric': 0.009633911368015413, 'fraction_numerical': 0.0, 'mean_word_length': 5.5, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reducers of selection

Motivated by growing interest in evolutionary network theory, we construct the first examples of undirected graph structures acting as reducers of selection. This means that the average fixation probability of an advantageous invader individual placed at some node is strictly less than that of this individual placed in a well-mixed population. Computer aided techniques are used to obtain an exact analytical expression of the fixation probability proving that selection is effectively reduced.