相关论文: Suppressors of selection

As graph data becomes more ubiquitous, the need for robust inferential graph algorithms to operate in these complex data domains is crucial. In many cases of interest, inference is further complicated by the presence of adversarial data…

We study the combined influence of selection and random fluctuations on the evolutionary dynamics of two-strategy ("cooperation" and "defection") games in populations comprising cooperation facilitators. The latter are individuals that…

Deep learning on graph structures has shown exciting results in various applications. However, few attentions have been paid to the robustness of such models, in contrast to numerous research work for image or text adversarial attack and…

In this paper, we study the \textit{graph condensation} problem by compressing the large, complex graph into a concise, synthetic representation that preserves the most essential and discriminative information of structure and features. We…

Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…

In human societies the probability of strategy adoption from a given person may be affected by the personal features. Now we investigate how an artificially imposed restricted ability to reproduce, overruling ones fitness, affects an…

Stronger selection implies faster evolution---that is, the greater the force, the faster the change. This apparently self-evident proposition, however, is derived under the assumption that genetic variation within a population is primarily…

We study a recently proposed model in which an odd number of agents are competing to be in the minority. The agents have one strategy in hand which is to follow the most recent history. Each agent is also assigned a value p, which is the…

In subdivided populations, migration acts together with selection and genetic drift and determines their evolution. Building up on a recently proposed method, which hinges on the emergence of a time scale separation between local and global…

We study the Moran process as adapted by Lieberman, Hauert and Nowak. This is a model of an evolving population on a graph or digraph where certain individuals, called "mutants" have fitness r and other individuals, called non-mutants have…

Whether or not cooperation is favored over defection in evolutionary games can be assigned by structure coefficients for any arrangement of cooperators and defectors on any network modeled as a regular graph. We study how these structure…

Vertex classification is vulnerable to perturbations of both graph topology and vertex attributes, as shown in recent research. As in other machine learning domains, concerns about robustness to adversarial manipulation can prevent…

We study the influence of complex graphs on the metastability and fixation properties of a set of evolutionary processes. In the framework of evolutionary game theory, where the fitness and selection are frequency-dependent and vary with…

In evolutionary game theory, an important measure of a mutant trait (strategy) is its ability to invade and take over an otherwise-monomorphic population. Typically, one quantifies the success of a mutant strategy via the probability that a…

A selective sweep describes the reduction of linked genetic variation due to strong positive selection. If s is the fitness advantage of a homozygote for the beneficial allele and h its dominance coefficient, it is usually assumed that…

Link prediction systems (e.g. recommender systems) typically use graph topology as one of their main sources of information. However, automorphisms and related properties of graphs beget inherent limits in predictability. We calculate hard…

Computational intractability has for decades motivated the development of a plethora of methodologies that mainly aimed at a quality-time trade-off. The use of Machine Learning techniques has finally emerged as one of the possible tools to…

It is well understood that the structure of a social network is critical to whether or not agents can aggregate information correctly. In this paper, we study social networks that support information aggregation when rational agents act…

We consider the Moran process, as generalized by Lieberman, Hauert and Nowak (Nature, 433:312--316, 2005). A population resides on the vertices of a finite, connected, undirected graph and, at each time step, an individual is chosen at…

This paper studies graphical model selection, i.e., the problem of estimating a graph of statistical relationships among a collection of random variables. Conventional graphical model selection algorithms are passive, i.e., they require all…