Matches in SemOpenAlex for { <https://semopenalex.org/work/W2766269359> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W2766269359 endingPage "804" @default.
- W2766269359 startingPage "790" @default.
- W2766269359 abstract "The Moran process, as studied by Lieberman et al. [L05], is a stochastic process modeling the spread of genetic mutations in populations. In this process, agents of a two-type population (i.e. mutants and residents) are associated with the vertices of a graph. Initially, only one vertex chosen u.a.r. is a mutant, with fitness $r > 0$, while all other individuals are residents, with fitness $1$. In every step, an individual is chosen with probability proportional to its fitness, and its state (mutant or resident) is passed on to a neighbor which is chosen u.a.r. In this paper, we introduce and study for the first time a generalization of the model of [L05] by assuming that different types of individuals perceive the population through different graphs, namely $G_R(V,E_R)$ for residents and $G_M(V,E_M)$ for mutants. In this model, we study the fixation probability, i.e. the probability that eventually only mutants remain in the population, for various pairs of graphs. First, we transfer known results from the original single-graph model of [L05] to our 2-graph model. Among them, we provide a generalization of the Isothermal Theorem of [L05], that gives sufficient conditions for a pair of graphs to have the same fixation probability as a pair of cliques. Next, we give a 2-player strategic game view of the process where player payoffs correspond to fixation and/or extinction probabilities. In this setting, we attempt to identify best responses for each player and give evidence that the clique is the most beneficial graph for both players. Finally, we examine the possibility of efficient approximation of the fixation probability. We show that the fixation probability in the general case of an arbitrary pair of graphs cannot be approximated via a method similar to [D14]. Nevertheless, we provide a FPRAS for the special case where the mutant graph is complete." @default.
- W2766269359 created "2017-11-10" @default.
- W2766269359 creator A5011756177 @default.
- W2766269359 creator A5017634682 @default.
- W2766269359 creator A5024301526 @default.
- W2766269359 creator A5079757202 @default.
- W2766269359 date "2018-01-01" @default.
- W2766269359 modified "2023-10-16" @default.
- W2766269359 title "Mutants and Residents with Different Connection Graphs in the Moran Process" @default.
- W2766269359 cites W2039327508 @default.
- W2766269359 cites W2066720893 @default.
- W2766269359 cites W2079460424 @default.
- W2766269359 cites W2085728653 @default.
- W2766269359 cites W2146419044 @default.
- W2766269359 cites W2159808062 @default.
- W2766269359 cites W2194397134 @default.
- W2766269359 cites W2205121374 @default.
- W2766269359 cites W3099831495 @default.
- W2766269359 cites W3142588439 @default.
- W2766269359 cites W4242285942 @default.
- W2766269359 doi "https://doi.org/10.1007/978-3-319-77404-6_57" @default.
- W2766269359 hasPublicationYear "2018" @default.
- W2766269359 type Work @default.
- W2766269359 sameAs 2766269359 @default.
- W2766269359 citedByCount "1" @default.
- W2766269359 countsByYear W27662693592019 @default.
- W2766269359 crossrefType "book-chapter" @default.
- W2766269359 hasAuthorship W2766269359A5011756177 @default.
- W2766269359 hasAuthorship W2766269359A5017634682 @default.
- W2766269359 hasAuthorship W2766269359A5024301526 @default.
- W2766269359 hasAuthorship W2766269359A5079757202 @default.
- W2766269359 hasConcept C13355873 @default.
- W2766269359 hasConcept C199360897 @default.
- W2766269359 hasConcept C2524010 @default.
- W2766269359 hasConcept C33923547 @default.
- W2766269359 hasConcept C41008148 @default.
- W2766269359 hasConcept C98045186 @default.
- W2766269359 hasConceptScore W2766269359C13355873 @default.
- W2766269359 hasConceptScore W2766269359C199360897 @default.
- W2766269359 hasConceptScore W2766269359C2524010 @default.
- W2766269359 hasConceptScore W2766269359C33923547 @default.
- W2766269359 hasConceptScore W2766269359C41008148 @default.
- W2766269359 hasConceptScore W2766269359C98045186 @default.
- W2766269359 hasLocation W27662693591 @default.
- W2766269359 hasOpenAccess W2766269359 @default.
- W2766269359 hasPrimaryLocation W27662693591 @default.
- W2766269359 hasRelatedWork W1877967482 @default.
- W2766269359 hasRelatedWork W18787096 @default.
- W2766269359 hasRelatedWork W1978142926 @default.
- W2766269359 hasRelatedWork W2083193279 @default.
- W2766269359 hasRelatedWork W2370652759 @default.
- W2766269359 hasRelatedWork W2748952813 @default.
- W2766269359 hasRelatedWork W2899084033 @default.
- W2766269359 hasRelatedWork W3057679130 @default.
- W2766269359 hasRelatedWork W587735977 @default.
- W2766269359 hasRelatedWork W831794578 @default.
- W2766269359 isParatext "false" @default.
- W2766269359 isRetracted "false" @default.
- W2766269359 magId "2766269359" @default.
- W2766269359 workType "book-chapter" @default.