{'fraction_non_alphanumeric': 0.012096774193548387, 'fraction_numerical': 0.0, 'mean_word_length': 5.744565217391305, '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}}
Analytical description for the critical fixations of evolutionary coordination games on finite complex structured populations.

Evolutionary game theory is crucial to capturing the characteristic interaction patterns among selfish individuals. In a population of coordination games of two strategies, one of the central problems is to determine the fixation probability that the system reaches a state of networkwide of only one strategy, and the corresponding expectation times. The deterministic replicator equations predict the critical value of initial density of one strategy, which separates the two absorbing states of the system. However, numerical estimations of this separatrix show large deviations from the theory in finite populations. Here we provide a stochastic treatment of this dynamic process on complex networks of finite sizes as Markov processes, showing the evolutionary time explicitly. We describe analytically the effects of network structures on the intermediate fixations as observed in numerical simulations. Our theoretical predictions are validated by various simulations on both random and scale free networks. Therefore, our stochastic framework can be helpful in dealing with other networked game dynamics.