No abstract uploaded!

Evolution occurs in populations of reproducing individuals. The structure of a population can affect which traits evolve 1, 2. Understanding evolutionary game dynamics in structured populations remains difficult. Mathematical results are known for special structures in which all individuals have the same number of neighbours 3, 4, 5, 6, 7, 8. The general case, in which the number of neighbours can vary, has remained open. For arbitrary selection intensity, the problem is in a computational complexity class that suggests there is no efficient algorithm 9. Whether a simple solution for weak selection exists has remained unanswered. Here we provide a solution for weak selection that applies to any graph or network. Our method relies on calculating the coalescence times 10, 11 of random walks 12. We evaluate large numbers of diverse population structures for their propensity to favour cooperation. We study how small

No abstract uploaded!

On any smooth algebraic variety over a p-adic local field, we construct a tensor functor from the category of de Rham p-adic ́etale local systems to the category of filtered algebraic vector bundles with integrable connections satisfying the Griffiths transversality, which we view as a p-adic analogue of Deligne’s classical Riemann–Hilbert correspondence. A crucial step is to construct canonical extensions of the desired connections to suitable compactifications of the algebraic variety with logarithmic poles along the boundary, in a precise sense characterized by the eigenvalues of residues; hence the title of the paper. As an application, we show that this p-adic Riemann–Hilbert functor is compatible with the classical one over all Shimura varieties, for local systems attached to representations of the associated reductive algebraic groups.

No abstract uploaded!