相关论文: Suppressors of selection

Neural networks are vulnerable to adversarially-constructed perturbations of their inputs. Most research so far has considered perturbations of a fixed magnitude under some $l_p$ norm. Although studying these attacks is valuable, there has…

Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select the member with the…

We investigate the exploration of rugged fitness landscapes by spatially structured populations with demes on the nodes of a graph, connected by migrations. In the rare migration regime, we find that finite structures can adapt more…

We study stochastic evolutionary game dynamics in a population of finite size. Individuals in the population are divided into two dynamically evolving groups. The structure of the population is formally described by a Wright-Fisher type…

The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model (VM) dynamics)…

The Voter model is a well-studied stochastic process that models the invasion of a novel trait $A$ (e.g., a new opinion, social meme, genetic mutation, magnetic spin) in a network of individuals (agents, people, genes, particles) carrying…

Population structure affects the outcome of natural selection. Static population structures can be described by graphs, where individuals occupy the nodes, and interactions occur along the edges. General conditions for evolutionary success…

Competition between biological species in marine environments is affected by the motion of the surrounding fluid. An effective 2D compressibility can arise, for example, from the convergence and divergence of water masses at the depth at…

We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…

Efficient probabilistic inference by variable elimination in graphical models requires an optimal elimination order. However, finding an optimal order is a challenging combinatorial optimisation problem for models with a large number of…

The probability that an advantageous mutant rises to fixation in a viral quasispecies is investigated in the framework of multi-type branching processes. Whether fixation is possible depends on the overall growth rate of the quasispecies…

Stable mixtures of cooperators and defectors are often seen in nature. This fact is at odds with predictions based on linear public goods games under weak selection. That model implies fixation either of cooperators or of defectors, and the…

Biological networks often encapsulate promotion/inhibition as signed edge-weights of a graph. Nodes may correspond to genes assigned expression levels (mass) of respective proteins. The promotion/inhibition nature of co-expression between…

We study strategic classification in binary decision-making settings where agents can modify their features in order to improve their classification outcomes. Importantly, our work considers the causal structure across different features,…

The spatial structure of populations may promote the emergence and maintenance of cooperation. Cooperation in the prisoner's dilemma is favored under specific update rules in evolutionary graph theory models with one individual per node of…

Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…

Network structure is a mechanism for promoting cooperation in social dilemma games. In the present study, we explore graph surgery, i.e., to slightly perturb the given network, towards a network that better fosters cooperation. To this end,…

Although mutations drive the evolutionary process, the rates at which the mutations occur are themselves subject to evolutionary forces. Our purpose here is to understand the role of selection and random genetic drift in the evolution of…

Evolutionary game theory has proved to be a powerful tool to probe the self-organisation of collective behaviour by considering frequency-dependent fitness in evolutionary processes. It has shown that the stability of a strategy depends not…

Preservers and additive spanners are sparse (hence cheap to store) subgraphs that preserve the distances between given pairs of nodes exactly or with some small additive error, respectively. Since real-world networks are prone to failures,…