Yu-Ting Chen

Yu-Ting Chen

Auto-generated profile, based on publicly available information

Yu-Ting Chen

Department of Mathematics and Statistics University of Victoria Columbia British Canada

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2017 in Nature
Verified
Journal Article
Closed access
BABenjamin Allen
Benjamin Allen
GLGabor Lippner
Gabor Lippner
YCYu-Ting Chen
Yu-Ting Chen
BFBabak Fotouhi
Babak Fotouhi
NMNaghmeh Momeni
Naghmeh Momeni
MNMartin A. Nowak
Martin A. Nowak

1 April 2013 in The Annals of Applied Probability
Verified
Journal Article
Open access
YCYu-Ting Chen
Yu-Ting Chen
We study two of the simple rules on finite graphs under the death–birth updating and the imitation updating discovered by Ohtsuki, Hauert, Lieberman and Nowak [Nature 441 (2006) 502–505]. Each rule specifies a payoff-ratio cutoff point for the magnitude of fixation probabilities of the underlying evolutionary game between cooperators and defectors. We view the Markov chains associated with the two updating mechanisms as voter model perturbations. Then we present a first-order approximation for fixation probabilities of general voter model perturbations on finite graphs subject to small perturbation in terms of the voter model fixation probabilities. In the context of regular graphs, we obtain algebraically explicit first-order approximations for the fixation probabilities of cooperators distributed as certain uniform distributions. These approximations lead to a rigorous proof that both of the rules of Ohtsuki et al. are valid and are sharp.

1 February 2016 in Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
Verified
Journal Article
Closed access
PDF file
YCYu-Ting Chen
Yu-Ting Chen
JCJihyeok Choi
Jihyeok Choi
JCJ. Theodore Cox
J. Theodore Cox
We study voter models defined on large finite sets. Through a perspective emphasizing the martingale property of voter density processes, we prove that in general, their convergence to the Wright–Fisher diffusion only involves certain averages of the voter models over a small number of spatial locations. This enables us to identify suitable mixing conditions on the underlying voting kernels, one of which may just depend on their eigenvalues in some contexts, to obtain the convergence of density processes. We show by examples that these conditions are satisfied by a large class of voter models on growing finite graphs. Nous étudions le modèle du votant sur des ensembles contenant un nombre grand mais fini de sites. En nous servant des propriétés de martingales des densités du modèle du votant nous prouvons qu’ il y a convergence vers une diffusion Wright–Fisher. De plus cette preuve de convergence n’utilise que certaines moyennes sur un petit nombre de sites. Ceci nous permet d’identifier des conditions de mélange concernant le noyau du votant sous-jacent. Dans certains cas une de ces conditions nous permet de démontrer la convergence des densités en n’utilisant que les valeurs propres des noyaux. Nous donnons des exemples montrant que ces conditions de mélange sont satisfaites pour une grande classe de modèles du votant sur des ensembles croissants de graphes.

1 September 2012 in The Annals of Probability
Verified
Journal Article
Open access
PDF file
YCYu-Ting Chen
Yu-Ting Chen
JDJean-François Delmas
Jean-François Delmas
We consider an elementary model of random size varying population governed by a stationary continuous-state branching process. We compute the distributions of various variables related to the most recent common ancestor (MRCA): the time to the MRCA, the size of the current population and the size of the population just before the MRCA. In particular we observe a natural mild bottleneck effect as the size of the population just before the MRCA is stochastically smaller than the size of the current population. We also compute the number of individuals involved in the last coalescent event of the genealogical tree, that is, the number of individuals at the time of the MRCA who have descendants in the current population. By studying more precisely the genealogical structure of the population, we get asymptotics for the number of ancestors just before the current time. We give explicit computations in the case of the quadratic branching mechanism. In this case, the size of the population at the MRCA is, in mean, $2/3$ of the size of the current population. We also provide in this case the fluctuations for the renormalized number of ancestors.

22 December 2016 in Scientific Reports
Verified
Journal Article
Open access
YCYu-Ting Chen
Yu-Ting Chen
AMAlex McAvoy
Alex McAvoy
MNMartin A. Nowak
Martin A. Nowak
Population structure and spatial heterogeneity are integral components of evolutionary dynamics, in general, and of evolution of cooperation, in particular. Structure can promote the emergence of cooperation in some populations and suppress it in others. Here, we provide results for weak selection to favor cooperation on regular graphs for any configuration, meaning any arrangement of cooperators and defectors. Our results extend previous work on fixation probabilities of rare mutants. We find that for any configuration cooperation is never favored for birth-death (BD) updating. In contrast, for death-birth (DB) updating, we derive a simple, computationally tractable formula for weak selection to favor cooperation when starting from any configuration containing any number of cooperators. This formula elucidates two important features: (i) the takeover of cooperation can be enhanced by the strategic placement of cooperators and (ii) adding more cooperators to a configuration can sometimes suppress the evolution of cooperation. These findings give a formal account for how selection acts on all transient states that appear in evolutionary trajectories. They also inform the strategic design of initial states in social networks to maximally promote cooperation. We also derive general results that characterize the interaction of any two strategies, not only cooperation and defection.

13 June 2014 in Journal of Statistical Physics
Verified
Journal Article
Closed access
PDF file
CHChristoph Hauert
Christoph Hauert
YCYu-Ting Chen
Yu-Ting Chen
LILorens A. Imhof
Lorens A. Imhof