Searcharxiv⌕ Search

arXiv subjects

Yu-Ting Chen

Publications and source records attributed to Yu-Ting Chen.

49 records · Page 3Linked to original sources

Cavity cooling of many atoms

We demonstrate cavity cooling of all motional degrees of freedom of an atomic ensemble using light that is far detuned from the atomic transitions by several gigahertz. The cooling is achieved by cavity-induced frequency-dependent asymmetric enhancement of the atomic emission spectrum, thereby extracting thermal kinetic energy from the atomic system. Within $100 ~\mathrm{ms}$, the atomic temperature is reduced from $200 ~μ\mathrm{K}$ to $10 ~μ\mathrm{K}$, where the final temperature is mainly limited by the linewidth of the cavity. In principle, the technique can be applied to molecules and atoms with complex internal energy structure.

physics.atom-ph↗

Evolutionary dynamics on any population structure

Evolution occurs in populations of reproducing individuals. The structure of a biological population affects which traits evolve. Understanding evolutionary game dynamics in structured populations is difficult. Precise results have been absent for a long time, but have recently emerged for special structures where all individuals have the same number of neighbors. But the problem of determining which trait is favored by selection in the natural case where the number of neighbors can vary, has remained open. For arbitrary selection intensity, the problem is in a computational complexity class which suggests there is no efficient algorithm. Whether there exists a simple solution for weak selection was unanswered. Here we provide, surprisingly, a general formula for weak selection that applies to any graph or social network. Our method uses coalescent theory and relies on calculating the meeting times of random walks. We can now evaluate large numbers of diverse and heterogeneous population structures for their propensity to favor cooperation. We can also study how small changes in population structure---graph surgery---affect evolutionary outcomes. We find that cooperation flourishes most in societies that are based on strong pairwise ties.

q-bio.PE↗

Fixation probabilities for any configuration of two strategies on regular graphs

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 single, randomly placed 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 and defectors. 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.

q-bio.PE↗

ARAPrototyper: Enabling Rapid Prototyping and Evaluation for Accelerator-Rich Architectures

Compared to conventional general-purpose processors, accelerator-rich architectures (ARAs) can provide orders-of-magnitude performance and energy gains and are emerging as one of the most promising solutions in the age of dark silicon. However, many design issues related to the complex interaction between general-purpose cores, accelerators, customized on-chip interconnects, and memory systems remain unclear and difficult to evaluate. In this paper we design and implement the ARAPrototyper to enable rapid design space explorations for ARAs in real silicons and reduce the tedious prototyping efforts far down to manageable efforts. First, ARAPrototyper provides a reusable baseline prototype with a highly customizable memory system, including interconnect between accelerators and buffers, interconnect between buffers and last-level cache (LLC) or DRAM, coherency choice at LLC or DRAM, and address translation support. Second, ARAPrototyper provides a clean interface to quickly integrate users' own accelerators written in high-level synthesis (HLS) code. The whole design flow is highly automated to generate a prototype of ARA on an FPGA system-on-chip (SoC). Third, to quickly develop applications that run seamlessly on the ARA prototype, ARAPrototyper provides a system software stack, abstracts the accelerators as software libraries, and provides APIs for software developers. Our experimental results demonstrate that ARAPrototyper enables a wide range of design space explorations for ARAs at manageable prototyping efforts, which has 4,000X to 10,000X faster evaluation time than full-system simulations. We believe that ARAPrototyper can be an attractive alternative for ARA design and evaluation.

cs.AR↗

Weak atomic convergence of finite voter models toward Fleming-Viot processes

We consider the empirical measures of multi-type voter models with mutation on large finite sets, and prove their weak atomic convergence in the sense of Ethier and Kurtz (1994) toward a Fleming-Viot process. Convergence in the weak atomic topology is strong enough to answer a line of inquiry raised by Aldous (2013) concerning the distributions of the corresponding entropy processes and diversity processes for types.

math.PR↗

Pathwise nonuniqueness for the SPDEs of some super-Brownian motions with immigration

We prove pathwise nonuniqueness in the stochastic partial differential equations (SPDEs) for some one-dimensional super-Brownian motions with immigration. In contrast to a closely related case investigated by Mueller, Mytnik and Perkins [Ann. Probab. 42 (2014) 2032-2112], the solutions of the present SPDEs are assumed to be nonnegative and have very different properties including uniqueness in law. In proving possible separation of solutions, we derive delicate properties of certain correlated approximating solutions, which is based on a novel coupling method called continuous decomposition. In general, this method may be of independent interest in furnishing solutions of SPDEs with intrinsic adapted structure.oximating solutions, which may be of independent interest in the study of superprocesses with immigration.

math.PR↗

Van der Waals interactions in rare-gas dimers: The role of interparticle interactions

We investigate the potential energy curves of rare-gas dimers with various ranges and strengths of interparticle interactions (nuclear-electron, electron-electron, and nuclear-nuclear interactions). Our investigation is based on the highly accurate coupled-cluster theory associated with those interparticle interactions. For comparison, the performance of the corresponding Hartree-Fock theory, second-order Moller-Plesset perturbation theory, and density functional theory is also investigated. Our results reveal that when the interparticle interactions retain the long-range Coulomb tails, the nature of van der Waals interactions in the rare-gas dimers remains similar. By contrast, when the interparticle interactions are sufficiently short-range, the conventional van der Waals interactions in the rare-gas dimers completely disappear, yielding purely repulsive potential energy curves.

physics.chem-ph↗

Approximating Laplace transforms of meeting times for some symmetric Markov chains

We study distributions of meeting times for finite symmetric Markov chains. For Markov kernels defined on large state spaces which satisfy certain weak inhomogeneity in return probabilities of points up to large numbers of steps, we obtain approximation, with explicit error bounds, of the Laplace transforms of some meeting times (without scaling) by ratios of Green functions closely related to hitting times of points. In studying this approximation, we identify some key matrix power series in Markov kernels weighted with solutions to a discrete transport-like equation with explicit coefficients, which stems from the viewpoint that meeting time distributions are equivalent to correlations of some linear particle system. Our result applies in particular to random walks on large random regular graphs. It gives a justification of the corresponding practice, among other things, in Allen, Traulsen, Tarnita and Nowak (2012) on approximating certain critical values for the emergence of cooperation when mutation is present.

math.PR↗

On the convergence of densities of finite voter models to the Wright-Fisher diffusion

We study voter models defined on large 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. Our examples show that these conditions are satisfied by a large class of voter models on growing finite graphs.

math.PR↗

Multiparty Quantum Remote Control

This paper proposes a multiparty quantum remote control (MQRC) protocol, which allows several controllers to perform remote operations independently on a target state based on a shared entanglement of Greenberger-Home-Zeilinger (GHZ) state.

quant-ph↗

Sharp benefit-to-cost rules for the evolution of cooperation on regular graphs

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.

math.PR↗

Quantum Teleportation with Remote Rotation on a GHZ state

This study proposes a pioneering protocol for teleporting an arbitrary single particle state and simultaneously performing a rotation operation on that particle. There are protocols for either only teleporting particles or only remotely controlling quantum particles. If one has to remotely control a teleported quantum, then he/she has to first do the quantum teleportation and then perform the remote control on the teleported quantum. Both operations were done separately on two sets of entanglements. However, this intuitive solution is inefficient because many resources are wasted. Therefore, the study attempts to complete both operations using only one Greenberger-Horne-Zeilinger (GHZ) state.

quant-ph↗

Smaller population size at the MRCA time for stationary branching processes

We present an elementary model of random size varying population given by a stationary continuous state branching process. For this model we compute the joint distribution of: the time to the most recent common ancestor, the size of the current population and the size of the population just before the most recent common ancestor (MRCA). In particular we show 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 old families which corresponds to the number of individuals involved in the last coalescent event of the genealogical tree. 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, less by 1/3 than size of the current population size. We also provide in this case the fluctuations for the renormalized number of ancestors.

math.PR↗