Searcharxiv⌕ Search

arXiv subjects

Jason Schweinsberg

Publications and source records attributed to Jason Schweinsberg.

39 records · Page 3Linked to original sources

Random partitions approximating the coalescence of lineages during a selective sweep

When a beneficial mutation occurs in a population, the new, favored allele may spread to the entire population. This process is known as a selective sweep. Suppose we sample $n$ individuals at the end of a selective sweep. If we focus on a site on the chromosome that is close to the location of the beneficial mutation, then many of the lineages will likely be descended from the individual that had the beneficial mutation, while others will be descended from a different individual because of recombination between the two sites. We introduce two approximations for the effect of a selective sweep. The first one is simple but not very accurate: flip $n$ independent coins with probability $p$ of heads and say that the lineages whose coins come up heads are those that are descended from the individual with the beneficial mutation. A second approximation, which is related to Kingman's paintbox construction, replaces the coin flips by integer-valued random variables and leads to very accurate results.

math.PR↗

A coalescent model for the effect of advantageous mutations on the genealogy of a population

When an advantageous mutation occurs in a population, the favorable allele may spread to the entire population in a short time, an event known as a selective sweep. As a result, when we sample $n$ individuals from a population and trace their ancestral lines backwards in time, many lineages may coalesce almost instantaneously at the time of a selective sweep. We show that as the population size goes to infinity, this process converges to a coalescent process called a coalescent with multiple collisions. A better approximation for finite populations can be obtained using a coalescent with simultaneous multiple collisions. We also show how these coalescent approximations can be used to get insight into how beneficial mutations affect the behavior of statistics that have been used to detect departures from the usual Kingman's coalescent.

math.PR↗

Improving on bold play when the gambler is restricted

Suppose a gambler starts with a fortune in (0,1) and wishes to attain a fortune of 1 by making a sequence of bets. Assume thay whenever the gambler stakes the amount s, the gambler's fortune increases by s with probability w and decreases by s with probability 1 - w, where w < 1/2. Dubins and Savage showed that the optimal strategy, which they called "bold play", is always to stake min{f, 1-f}, where f is the gambler's current fortune. Here we consider the problem in which the gambler may stake no more than l at one time. We show that the bold strategy of always betting min{l, f, 1-f} is not optimal if l is irrational, extending a result of Heath, Pruitt, and Sudderth.

math.PR↗