STAT 536: Genetic Drift

Size: px
Start display at page:

Download "STAT 536: Genetic Drift"

Transcription

1 STT 536: Genetic Drift Krin S. Dormn Deprtment of Sttistics Iow Stte University October 05, 2006

2 Finite Popultion Size In finite popultions, rndom chnges in llele frequency result becuse of Vrition in the number of offspring per prent. Lw of segregtion in diploid species. The rndom chnges in llele frequency re clled genetic drift. Genetic drift is nother force cting on genes in popultions nd it hs two min consequences: It removes genetic vrition t rte inversely proportionl to the popultion size. It ffects the probbility of survivl of new muttions, in mnner pproximtely independent of the popultion size.

3 Neutrl Theory Just like there is selection/muttion blnce, there lso exists drift/muttion blnce, with genetic drift removing vrition nd muttion restoring vrition. The ide tht much of the genetic vrition present in popultions is the consequence of the drift/muttion blnce is clled the Neutrl Theory, very powerful concept in popultion genetics. The theory hs remined controversil since its inception becuse it is difficult to test it seems to negte the importnce of nturl selection, the core of Drwin s theory of evolution.

4 Simulting Popultions For diploid popultion of size N = 20 nd strting llele frequency of p(0) = 0.2, follow these steps to simulte genertion t + 1, Set K = 0. Choose to copy n llele with probbility p(t) nd increment K, otherwise generte B (non-) llele. Repet 2 N times. Compute the genertion t + 1 llele frequency p(t + 1) = K /2/N. Repet for 100 genertions. llele Frequency Genertion The result for 10 independent runs is shown in the plot.

5 Observtions bout simultions There re few things to observe bout these llele frequency fluctutions There re rndom chnges in llele frequency. ll 10 popultions disply different llele frequencies over time, thus evolution cn never be repeted. lleles re lost from the popultion, 3 times B ws lost, 6 times ws lost. Only one time did both lleles persist for 100 genertions. llele Frequency Genertion The direction of rndom chnges is neutrl, i.e. not preferentilly up or down. We will probbly need to prove this mthemticlly to truly convince you.

6 Inbred Individuls nd Finite Popultion Sizes n individul is inbred if she/he contins lleles t locus tht re IBD (identicl by descent). n individul becomes inbred becuse his/her ncestors re relted. The only wy to not be inbred is to hve completely unrelted ncestors. But, if there were no reltionships mong your ncestors, then if you re genertion t, you hve 2 distinct ncestors in genertion t 1 (your prents), 4 = 2 2 distinct prents in genertion t 2 (your grndprents), 8 = 2 3 distinct prents in genertion t 3 nd so on. It doesn t tke long before we re tlking bout terbytes of ncestors, more ncestors thn the size of the popultion N. Therefore, finite popultions led to inbred individuls nd everyone is t lest little inbred.

7 Inbred Popultions popultion is inbred if the probbility tht two lleles selected without replcement re IBD is positive. s popultion becomes inbred, so too the individuls. In rndomly segregting, rndomly mting popultions, the level of popultion inbreeding is equl to the level of individul inbreeding, i.e. the probbility tht two rndom lleles re IBD is the sme s the probbility tht the two lleles in rndom individul re IBD. We will often refer genericlly to inbreeding without distinguishing whether we men the individul or the popultion becuse of this equivlency.

8 Mintining Diversity in Finite Popultions in Finite Popultions diploid bse popultion of size N will hve 2N distinct lleles t ech locus. Wht is the probbility tht none of these lleles is lost when pssing lleles to the next genertion? ssume tht ech prent hs precisely two offspring. Then the prent must pss one llele to one offspring (hppens with probbility 1) nd the other llele to the other offspring (hppens with probbility 1 2 ). So, the probbility tht ll prents pss on both lleles is ( ) N 1 2 very smll number! Therefore, it is very likely to lose one or few lleles during ech genertion. Plese contrst this conclusion with the sme sitution under HWE. n llele tht strts out t proportion 1 2N (i.e. it is present s one copy in size N popultion), will persist in HWE forever t the sme llele frequency 1 2N.

9 Genetic Drift In finite popultion, the persistence of n llele is not gurnteed. We lredy know there is very good chnce tht not ll lleles will mke it to the next genertion. So, some will be lost. The lost lleles re replced with IBD copies of other lleles. These other lleles gin in frequency nd the overll frction of ibd lleles in the next genertion will hve incresed. So, smll popultion size nd inbreeding go hnd-in-hnd. Genetic drift is synonymous with incresing levels of inbreeding. Genetic drift is dominting force in smll popultions.

10 llele Fixtion If we crry the bove process of llele loss t ech genertion forwrd in time, it leds to the conclusion tht ultimte there will remin only one llele in the popultion. While t first it is very esy to remove lleles, the numbers of the remining lleles increse nd it is less likely tht they will be removed t ech genertion. However, there is lwys positive, though smll, chnce tht n llele goes extinct in ech genertion. Combine these probbilities over enough genertions, nd eventully ll lleles but one will go extinct. In the end, genetic drift leds to the fixtion of one llele t every position in smll popultion. The popultion will become completely inbred. Clerly, something in our rgument does not pply to rel life since ll popultions re finite, but they re not entirely inbred. There re other forces (muttion, migrtion, selection) tht cn counterct the effects of genetic drift. We will discuss them nd their reltionship to genetic drift lter.

11 Hploid Finite Popultion Consider hploid popultion of size N. If every individul copies itself to produce the next genertion, there is no chnge due to genetic drift. However, if some individuls fil to copy themselves, while other copy themselves more thn once, there will be rndom chnges in llele frequencies nd genetic drift will pply to the popultion. Hence, genetic drift in hploid popultions is determined by the vrince in number of offspring. If there is no vribility, there is no genetic drift. There re mny wys tht the number of offspring could vry mong individuls. The simplest nd most mthemticlly elegnt is to think bckwrds gin. ssume tht ech offspring rndomly selects his/her prent.

12 Biologicl Plusibility If (1) ech prent produces huge number of offspring initilly, but (2) ech prent produces exctly the sme huge number of offspring, nd (3) these offspring re killed off t rndom (without regrd to genotype) until there re only N left, then the bove model will pply quite well. Killing off t rndom cn lso be thought of s selecting few lucky survivors (N to be precise) t rndom. The key observtion is tht ech time one of the lucky survivors is selected, the pool of offspring from tht prent is not substntilly decresed.

13 Popultion Inbreeding Recurrence Reltion Let f t be the mount of inbreeding t genertion t. Here, we men popultion inbreeding, since there is no concept of inbred individuls. We will develop recurrence reltion for f t with time. f t = P(two individuls hve ibd lleles) = P(ibd two indivs. select sme prent)p(two indivs. select sme prent) + P(ibd two indivs. select diff. prents)p(two indivs. selected diff. prents) = 1 1 N + f t «. N The solution is f t = 1 N 1 N ( ) 1 1 t 1 N N = 1 ( 1 1 ) t. 1 N N

14 Interprettion of Solution Looking t the solution ( f t = ) t, N we see tht in the limit f t 1. nd ech genertion, the probbility of non-ibd lleles h t = 1 f t declines by nother frction 1 N. Note lso tht the bove is the verge behvior of mny popultions. Now rndom chnce is very importnt force in these smll popultions. So the ctul level of inbreeding in popultion t genertion t will be something round f t but my show substntil vrition from popultion to popultion.

15 Diploid Equivlent Now, consider diploid popultion where ll the prents produce huge pools of gmetes tht re thrown into common gmetic pool. ssume rndom union of gmetes nd ssume hermphroditic dults tht cn self-fertilize. Then, the offspring cn be thought of s rndomly selecting two individuls from the previous genertion to be its prents. In fct, this model is equivlent to the hploid model in the sense tht ech offspring cn be thought of s rndomly selecting two lleles from the preceding genertion. s before, the probbility tht these two lleles re IBD is given by the recursion eqution: f t = 1 2N + f t 1 since now there re 2N gmetes. ( 1 1 2N The solution s before is f t = 1 ( 1 1 2N ) t with 2N replcing N. ),

16 Rte of Loss of Heterozygosity Inbreeding results in the increse of ibd lleles nd obligte loss of heterozygosity (ech new inbred individul replces either homozygote or heterozygote, the ltter replcement resulting in grdul loss of heterozygotes from the popultion). How fst does this occur? Let h t = 1 f t be the probbility tht the two lleles t locus re not ibd. Then, ( h t = 1 1 ) t. 2N Clerly, the smller N, the fster the increse in heterozygosity. nd exmining the updte eqution f t = 1 2N + ( 1 1 2N ) f t 1, we see in ech genertion frction 1 lleles (i.e. new inbreeding). 2N of ll ibd lleles re new ibd

17 Rte of New Inbreeding Genertions 1 to 100 Genertions 100 to 1000

18 nother View of the Rte If we write f = 1 2N for the new inbreeding introduced ech genertion, then the updte eqution looks like (Note: f f t f t 1!) Rerrnge this eqution to find f t = f + (1 f ) f t 1. f = f t f t 1 1 f t 1. This is the rte of chnge of the inbreeding coefficient f t genertion t reltive to the totl mount it hs left to go before chieving complete inbreeding f = 1.

19 Recovery from Bottleneck Sometimes popultions re subject to bottlenecks (brief periods of time when their numbers drop to very low numbers where genetic drift domintes). n interesting question is whether restoring their numbers will reverse the dmge done to during the bottleneck. To be specific, is inbreeding reduced fter the popultion numbers re restored? To nswer this question, we will ssume the popultion ends the bottleneck with inbreeding t f 0 > 0 nd then subsequently the popultion immeditely rises to infinite size N =. Wht will hppen to inbreeding? We exmine the updte eqution f t = 1 2N + ( 1 1 2N ) f t 1 = f t 1 = = f 0, so the level of inbreeding remins fixed t f 0 > 0 despite the huge increse in popultion size.

20 Time to Trget Heterozygosity Loss We cn use the time-dependent equtions to lso find how much time is needed to lose pre-defined mount of heterozygosity. For exmple, the hlf-life t 0.5 for heterozygosity, the time it tkes to remove 1 2 of the current heterozygosity h 0 is ( h t0.5 = 1 1 ) t0.5 = h 0 2N 2 t 0.5 = ln h 0 ln 2 ln ( ) 1 1 2N For smll x, ln(1 x) x by Tylor s series so for lrge N, t 0.5 ln h 0 ln N Or when the current heterozygosity h 0 = 1, mening no inbreeding, t N. (Note: For hploids, the hlf-life is t N.)

21 Hlf-Life of Heterozygosity t 0.5 cn be thought of the hlf-life of heterozygosity. The diploid result t 0.5 = 2N ln(2) shows tht the hlf-life is proportionl to the popultion size. It tkes longer to lose heterozygosity if the popultion is lrger. For exmple, popultion size of 1 million tht reproduces every 20 yers would require 28 million yers to lose hlf of its heterozygosity. Lrge browsing mmmls nd the first monkey-like primtes were first ppering long with the lps nd Himlys here on plnet erth. For resonbly lrge popultions, genetic drift is slow process.

22 Wright-Fisher - Hploid In popultion of size N, the frequency of llele t genertion t is { 0 p t N = 0, 1 N, 2 N,..., N } N = 1. Suppose tht currently p t = i N, so there re i copies of llele in the popultion. The next genertion offspring will ech independently select lleles t rndom from the current genertion, nd with probbility p t, ech will select n llele. If X t is the number of llele copies in the popultion t genertion t, then X t+1 Binomil(N, p t ). We cn define trnsition probbilities P ij (t) = P (X t+1 = j X t = i), where ( ) N P ij (t) = p j t j (1 p t) N j, with p t = i N.

23 Wright-Fisher - Diploid For the simple diploid model, the offspring select their lleles rndomly from the previous genertion (without worrying to mke sure tht they obtined one from fther nd the other from femle). Then, the trnsition probbilities re ( ) 2N P ij (t) = p j t j (1 p t) 2N j, with p t = i 2N. With the simple diploid model we need not chnge the equtions except to multiply ll N s by 2. We hve defined simple Mrkov chin.

24 Some Results from Mrkov Chin Theory The stte of this Mrkov chin is the number of lleles in the popultion. t ech genertion, this stte is updted ccording to the trnsition probbilities defined bove. How the chin s stte is updted depends only on the current stte of the system (the current number of lleles). How it will be updted does not depend on the whole history of this popultion. For this reson, the stochstic process is clled Mrkovin. In ddition, we observe tht there re two bsorbing sttes (0 nd 1) from which the chin cnnot escpe, mening once tht stte is entered, the chin will never leve tht stte. This is of course true only in the bsence of muttion nd migrtion. ll other sttes re wht re clled trnsient sttes mening tht they will only be visited finite number of times. Eventully the chin will bump into one of the bsorbing sttes, preventing ny more visits to the trnsient sttes.

25 Properties of this Process While the Mrkov chin cn provide us with mny useful results bout this process we re modeling it fils to give us closed form solution for the distribution of future llele frequencies. In fct, there is no known solution to this complete specifiction of the process. Insted, we must rely on summry descriptions (e.g. men nd vrince) to describe the rndom process of genetic drift.

26 Men of Genetic Drift Recll X t is the number of lleles in the popultion t time t, nd X t+1 is binomilly-distributed rndom vrible with success probbility Xt 2N. Then, by the properties of the binomil distribution E (X t+1 X t ) = 2N X t 2N = X t. In generl, becuse E[E(X Y )] = E[X], we hve E (X t+1 ) = E (X t ) = E (X t 1 ) = = X 0, where X 0 is the initil number of lleles in the popultion. Divide through by 2N, to obtin E (p t+1 ) = E (p t ) = E (p t 1 ) = = p 0.

27 Fixtion Probbilities ll popultions ultimtely become fixed. Exmine collection of popultions tht ll strt with the sme llele frequency p 0. t time t, let Y it indicte whether the ith popultion hs fixed llele. We wnt to know wht proportion of popultions fixed llele s t, i.e. lim t P(Y it = 1) = lim t E(Y it ). But becuse the expecttion does not chnge in time, the overll frequency of llele cross ll these popultions must be p 0, therefore p 0 = P(Y i0 = 1) = P(Y i1 = 1) = = P(Y it = 1) = = lim t P(Y it = 1) nd we conclude tht the probbility tht fixes in the popultion is equl the initil strting frequency of llele. The more llele present t the beginning, the more replicte popultions it is likely to persist in or the more likely it is to persist in single popultion.

28 Fixtion in Replicte Popultions

29 Vrince in llele Frequency Since X t+1 Binomil(2N, p t ), the properties of the binomil distribution provide Vr(X t+1 p t ) = 2Np t (1 p t ). Converting to vrince in llele proportions, we hve Vr(p t+1 p t ) = p t(1 p t ). 2N We cn lso think of the next genertion count s X t+1 = X t + e x, or the next llele frequency s p t+1 = p t + e, where e is some rndom devition from the previous llele frequency. The rndom devition e hs men E(e) = 0, since E(p t+1 ) = E(p t ).

30 Vrince in llele Frequency In ddition, ll the vrince of the updte to p t+1 = p t + e is contined in the devition e Vr(p t+1 p t ) = Vr(e) = E(e 2 ), since p t is non-rndom by the conditioning nd E(e) = 0. E(pt+1 2 p t ) = E [ (p t + e) 2] = E ( pt 2 ) + 2E (pt e) + E ( e 2) = p 2 t + 2p t E(e) + E(e 2 ) = p 2 t + p t(1 p t ) 2N = p 2 t ( 1 1 ) + p t 2N 2N.

31 Vrince of llele Frequencies However, we seek the unconditionl probbility E(p 2 t+1) = E [ E(p 2 t+1 p t ) ], which is obtined by tking second expecttion over ll possible p t. ( E(pt+1) 2 = E(pt 2 ) 1 1 ) + E(p t) 2N 2N but we know llele frequency is unchnging in expecttion E(p t ) = p 0 nd of course, by definition of vrince E(p 2 t ) = Vr(p t ) + p 2 0. Thus, Vr(p t+1 ) + p0 2 = ( Vr(p t ) + p0 2 ) ( 1 1 ) + p 0 2N 2N.

32 Vrince of llele Frequencies The eqution we hve just derived cn be rerrnged into recurrence reltion for the llele frequency vrince ( Vr(p t+1 ) = Vr(p t ) 1 1 ) + p 0(1 p 0 ), 2N 2N with initil condition Vr(p 0 ) = 0. This is stndrd recurrence reltion you know how to solve. The solution is [ ( Vr(p t+1 ) = p 0 (1 p 0 ) ) ] t. 2N s t, the vrince in llele frequencies pproches p 0 (1 p 0 ).

33 Predicted llele Frequency nd Vrince Predicted llele Frequency N=1000 N= Future Genertions N=200 N=100

34 Genetic Drift nd Inbreeding Notice tht ( Vr(p t+1 ) p 0 (1 p 0 ) = ) t = f t. 2N This quntittes the reltionship between genetic drift nd inbreeding. The mount of inbreeding t genertion t is direct proportionl to the degree of vrince in llele frequencies between replicte popultions of the sme process.

35 Hndling ssumptions - effective popultion size Of course we hve mde some rther strong ssumptions in deriving these results. How cn we model more relistic popultions? One wy is to compre rel popultions to the idel Wright-Fisher popultion we hve been ssuming. Specificlly, we cn find the size of the idel popultion tht would hving the sme level of inbreeding s we observe in rel popultion. The (inbreeding) effective popultion size of rel popultion is the size of the idel popultion (stisfying our hermphroditic rndom mting model describe previously) tht would hve the sme level of inbreeding s our rel popultion. The symbol used to represent (inbreeding) effective popultion size is N e.

36 Multiple Definitions of N e To mtch levels of inbreeding, we cn choose N e such tht the frction of new inbreeding produced ech genertion (recll this is 1 2N e for the idel Wright-Fisher model) mtches the frction of new inbreeding produced in the rel popultion. Most often this is how the mtching between idel nd rel popultions is done, but there cn be other wys to compre popultions nd mke them mtch. The concept of effective popultion size cn then be difficult to interpret, especilly if it is not clrified how the equivlency is mde.

37 Disposing of Selfing ssumption The ssumption tht might hve you most worried is the ssumption of hermphroditic species. Very few species ctully stisfy this ssumption nd it seems tht it might cuse some difficulties. To quntitte how big n effect distinct sexes might hve on the results, we will explicitly model it in two phses. First we remove the ssumption tht prents cn self (fertilize themselves). Next, we remove the ssumption tht nyone cn mte with nyone, nd force mle plus femle mtings. s before, let h t be the probbility tht two lleles t locus re non-ibd. Let k t be the probbility tht two lleles selected t rndom from two rndomly selected individuls re not-ibd. First note h t+1 = k t. We ll derive k t+1 = 1 ( 2N h t ) k t. N

38 Second Eqution k t+1 is the probbility tht two rndomly selected lleles re not ibd in two rndom individuls. They cn only be non-ibd if the two individuls selected these genes from different prents or they selected different lleles from the sme prent. They select the sme prent with probbility 1 N, then with probbility 1 2 they select seprte lleles. With probbility h t, those two lleles will be non-ibd. They select different prents with probbility 1 1 N. The probbility tht they select non-ibd from these two prents is k t. ll together, the eqution resulting is k t+1 = 1 2N h t + ( 1 1 N ) k t.

39 Solving Recurrence Reltions Using h t = k t 1, we hve k t+1 = 1 2N k t 1 + ( 1 1 ) k t. N If we ssume logrithmic liner grow, k t+1 = λk t = λ 2 k t 1 or λ 2 k t 1 = 1 ( 2N k t ) λk t 1. N The relevnt solution is λ = 1 1 N N 2 which is just slightly different from 1 1 2N, the fctor tht pplies in the Wright-Fisher model. 2,

40 N e for Non-Selfers To compute the effective popultion size, we need the popultion size N e tht if evolving like the idel popultion would hve the sme single-genertion chnge in inbreeding s observed in this non-idel popultion. In other words, we need 1 1 N N 2 2 = 1 1 2N e. It turns out tht N e N + 1 2, so this popultion, where individuls must select two distinct prents, behves like n idel popultion where there is 1 2 dditionl individul in the popultion. Tht 1 2 extr individul will slow the effects of inbreeding very slightly. Essentilly, there is very little impct of forcing selection of distinct prents.

41 dding Distinct Sexes Suppose there re N f femles nd N m mles nd ech offspring must select one rndom fther nd one rndom mother from these pools. If the llele of interest is not sex-linked, then sex is ssigned independent of the genotype. We use the sme quntities h t nd k t. s before, h t+1 = k t. Two genes from different individuls cn only be non-ibd if they selected these lleles s two distinct lleles from the sme femle prent the sme mle prent, or entirely different prents.

42 Distinct Sexes (cont.) Two individuls select the sme femle prent with probbility 1 N f or the sme mle prent with probbility 1 N m. When we select to lleles t rndom from two individuls there is chnce tht they re both mternl or both pternl. 1 4 k t+1 = 1 [ ) ] 1 h t + (1 1Nf k t + 1 [ ( 1 h t ) ] k t N f 4 2N m N m 2 k t ( 1 = + 1 ) ( h t ) k t 8N f 8N m 4N f 4N m Compre this eqution to the one for distinct prents: k t+1 = 1 ( 2N h t ) k t. N

43 N e for Distinct Sexes The size N of the distinct-prent popultion tht would cquire inbreeding s fst s this distinct-sex popultion is given by 1 N = 1 + 1, 4N f 4N m which yields but then N = 4N f N m N f + N m, N e N = 4N f N m N f + N m Notice, tht when N f = N m = N 2, N = N, nd there is no effect of distinct sexes beyond tht of distinct prents when the sexes re blnced.

44 N e for Distinct Sexes Nevertheless, there cn be substntil impct when the sex rtio is not equl. For popultions with N = 100 but unequl sex rtios, the effective popultion size is N f N m N e

45 N e for Monogomous Species Of course the humn species fvors monogmy for the reproduction process. How does monogmy effect N e? To model this, hve the N dults split into N 2 pirs tht lst for life (we ssume N f = N m = N 2 so tht the sexes mtch up). Then, when offspring pick their prents, they first pick pir (fmily) nd then strt picking genes. h t+1 = k t k t+1 = 2 N ( = 1 2N h t + 2 h t k t ( 1 1 2N ) ) k t, ( ) k t N nd we conclude tht monogmy when there re equl frctions of ech sex does not chnge the rte of inbreeding fixtion.

46 Vrying Popultion Size Wht if the popultion size N t depends on time t? When the popultion size vries, the updte equtions revel t 1 ( h t = 1 1 ). 2N i i=0 The equivlent idel popultion would hve eh t = ( 1 1 ) t. 2N e Equting these such tht the sme level of inbreeding (or non-inbreeding ctully) is chieved by genertion t, we hve ( 1 1 ) = 2N e t 1 i=0 ( 1 1 ) 1/t. 2N i

47 N e for Vrying Popultion Size When ll N t re lrge despite the vrition from genertion to genertion, the pproximtion ( 1 1 ) 1/t 1 1 2N i 2N i t, so we hve ( 1 1 ) = 2N e t 1 i=0 ( 1 1 ). 2N i t Solving for N e, we hve N e = t t 1 i=0 1 N i, i.e. N e is the hrmonic men of the popultion sizes cross ll those genertions. Hrmonic mens tend to strongly weight low vlues over high vlues, so few dips in the popultion size will strongly dip the corresponding effective popultion size N e.

48 Oscillting Popultion Size Popultion Size N e N t Genertions

49 Rndom Vrition in Offspring Numbers We will now consider the effect of vribility in the number of offspring. ll individuls in the idel popultion produce n infinitely lrge number of offspring which re then selected rndomly to proceed into the next genertion. This is clerly n unresonble ssumption becuse obviously, no one cn produce infinitely mny offspring, nd the number of offspring produced per dult my vry (perhps becuse of rndom locl environments good or bd for rising offspring). In relxing this ssumption, we will continue to ssume infinitely mny offspring re produced, but different levels of infinity pply to different prents.

50 Probbility of Selecting Two Gmetes from Sme Prent Suppose the fitness of the ith individul is w i. These fitness vry from individul to individul not for genetic resons but becuse of rndom environmentl effects. In the infinite gmete pool from ll dults, there will be proportion gmetes produced by individul i. The probbility tht two gmetes come from prent i is ( ) 2 wi i w. i P w i i w i The probbility tht ny two gmetes come from the sme prent is the sum of the bove over ll possible prents i w 2 i ( j w j) 2. of

51 New Inbreeding per Genertion The mount of new inbreeding introduced per round of repliction is just the probbility tht the sme two gmetes re selected from the sme prent i w 2 i 1 ( 2 2. j j) w The frction 1 2 is the diploid fctor, the probbility tht the sme llele is selected both times from tht prent. The mount of new inbreeding introduced by ech ech round of repliction of n idel popultion is 1 2N e, so we conclude the effective popultion size for this rel popultion with vrying offspring numbers is ( j w j) 2 N e = i w 2 i.

52 N e for Offspring Vrition We re now going to write this in terms of the vrince in offspring numbers (or equivlently the vrince in the individul fitnesses w i ). where w = 1 N Therefore, Vr(w i ) = V w = 1 N i w 2 i w 2, i w i is the men fitness cross ll individuls. N e = = N 2 w 2 ( NVw + N w 2) N 1 + V w / w 2 = N 1 + Cw 2, where C 2 w = Vw w 2 is the squred coefficient of vrition of fitness.

53 Interprettion Notice N e < N, so vrition in offspring numbers reduces the effective popultion size below the census size nd increses the rte of ppernce of inbreeding. This should mke intuitive sense. Some individuls will contribute more offspring to the next genertion nd others will fil to contribute t ll. The results is more ibd lleles in the next genertion. The derivtion requires tht the fitnesses w i re constnt throughout the genertions, well t lest tht the men nd vrince re constnt. So, since these fitness differences re cused by the environment, the environment must be effectively constnt from genertion to genertion. There cn be locl vrition, but the overll verge environment nd vribility in the environment must remin constnt.

54 Vrying Surviving Gmetes It is lso possible to write the effective popultion size in terms of the vrition in the number of gmetes n i tht survive into the next genertion from individul i. Now, we re mesuring bsolute contribution to the next genertion, rther thn reltive contribution (it might be esier to mesure). Then (detils not shown), N e = 4N V n, where V n is the vrince in n i cross the popultion. When ll prents contribute exctly 2 gmetes to the next genertion, then V n = 0 nd N e = 2N 1, so the rel popultion cts like much lrger idel popultion; inbreeding is slowed.

55 Wright-Fisher Vrince V n Notice, the Wright-Fisher model lso hs n intrinsic vrince in offspring number. In Wright-Fisher, n i is the number of successes in 2N drws of Bernoulli rndom vrible with probbility of success 1 N. The vrince is ( ) ( 1 V n = 2N 1 1 ) = 2 2 N N N. This vrince is the smllest chievble vrince when offspring rndomly select gmetes from prents. So, ny other form of selecting gmetes tht is still rndom will decrese the effective popultion size. On the other hnd, if offspring do not select gmetes t rndom the effective popultion size cn be incresed. If gmetes re not selected t rndom, the bove formul is useful for computing V n nd N e. The derivtion of N e vi V w ssumes rndom selection of gmetes nd cnnot be used.

56 Summry The effective popultion size is n efficient mens of compring popultions by relting them ll to stndrd, idel popultion. It llows us to quickly evlute popultion nd mting scheme to determine how much inbreeding it will produce. If N e > N t, where N t is the census size of the rel popultion t time t, then the rel popultion hs ccumulted less inbreeding thn we would hve expected under idel conditions. If N e < N t, the the rel popultion hs been ccumulting more inbreeding thn the sme size idel popultion.

Population bottleneck : dramatic reduction of population size followed by rapid expansion,

Population bottleneck : dramatic reduction of population size followed by rapid expansion, Selection We hve defined nucleotide diversity denoted by π s the proportion of nucleotides tht differ between two rndomly chosen sequences. We hve shown tht E[π] = θ = 4 e µ where µ cn be estimted directly.

More information

Name Solutions to Test 3 November 8, 2017

Name Solutions to Test 3 November 8, 2017 Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Non-Linear & Logistic Regression

Non-Linear & Logistic Regression Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

DIRECT CURRENT CIRCUITS

DIRECT CURRENT CIRCUITS DRECT CURRENT CUTS ELECTRC POWER Consider the circuit shown in the Figure where bttery is connected to resistor R. A positive chrge dq will gin potentil energy s it moves from point to point b through

More information

Improper Integrals, and Differential Equations

Improper Integrals, and Differential Equations Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted

More information

Student Activity 3: Single Factor ANOVA

Student Activity 3: Single Factor ANOVA MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether

More information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

Review of basic calculus

Review of basic calculus Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below

More information

CS667 Lecture 6: Monte Carlo Integration 02/10/05

CS667 Lecture 6: Monte Carlo Integration 02/10/05 CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

Math 31S. Rumbos Fall Solutions to Assignment #16

Math 31S. Rumbos Fall Solutions to Assignment #16 Mth 31S. Rumbos Fll 2016 1 Solutions to Assignment #16 1. Logistic Growth 1. Suppose tht the growth of certin niml popultion is governed by the differentil eqution 1000 dn N dt = 100 N, (1) where N(t)

More information

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1 Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution

More information

13: Diffusion in 2 Energy Groups

13: Diffusion in 2 Energy Groups 3: Diffusion in Energy Groups B. Rouben McMster University Course EP 4D3/6D3 Nucler Rector Anlysis (Rector Physics) 5 Sept.-Dec. 5 September Contents We study the diffusion eqution in two energy groups

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

5.7 Improper Integrals

5.7 Improper Integrals 458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

221B Lecture Notes WKB Method

221B Lecture Notes WKB Method Clssicl Limit B Lecture Notes WKB Method Hmilton Jcobi Eqution We strt from the Schrödinger eqution for single prticle in potentil i h t ψ x, t = [ ] h m + V x ψ x, t. We cn rewrite this eqution by using

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response

More information

The steps of the hypothesis test

The steps of the hypothesis test ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann is the Mann! (But Lebesgue may besgue to differ.) Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

More information

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007 A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus

More information

Heat flux and total heat

Heat flux and total heat Het flux nd totl het John McCun Mrch 14, 2017 1 Introduction Yesterdy (if I remember correctly) Ms. Prsd sked me question bout the condition of insulted boundry for the 1D het eqution, nd (bsed on glnce

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil

More information

1 Probability Density Functions

1 Probability Density Functions Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our

More information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0) 1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this

More information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

Appendix 3, Rises and runs, slopes and sums: tools from calculus

Appendix 3, Rises and runs, slopes and sums: tools from calculus Appendi 3, Rises nd runs, slopes nd sums: tools from clculus Sometimes we will wnt to eplore how quntity chnges s condition is vried. Clculus ws invented to do just this. We certinly do not need the full

More information

MIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model:

MIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model: 1 2 MIXED MODELS (Sections 17.7 17.8) Exmple: Suppose tht in the fiber breking strength exmple, the four mchines used were the only ones of interest, but the interest ws over wide rnge of opertors, nd

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

SYDE 112, LECTURES 3 & 4: The Fundamental Theorem of Calculus

SYDE 112, LECTURES 3 & 4: The Fundamental Theorem of Calculus SYDE 112, LECTURES & 4: The Fundmentl Theorem of Clculus So fr we hve introduced two new concepts in this course: ntidifferentition nd Riemnn sums. It turns out tht these quntities re relted, but it is

More information

and that at t = 0 the object is at position 5. Find the position of the object at t = 2.

and that at t = 0 the object is at position 5. Find the position of the object at t = 2. 7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we

More information

221A Lecture Notes WKB Method

221A Lecture Notes WKB Method A Lecture Notes WKB Method Hmilton Jcobi Eqution We strt from the Schrödinger eqution for single prticle in potentil i h t ψ x, t = [ ] h m + V x ψ x, t. We cn rewrite this eqution by using ψ x, t = e

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Math Lecture 23

Math Lecture 23 Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of

More information

Continuous Random Variables

Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

More information

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one

More information

Chapter 5 : Continuous Random Variables

Chapter 5 : Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll

More information

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Tests for the Ratio of Two Poisson Rates

Tests for the Ratio of Two Poisson Rates Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

Bernoulli Numbers Jeff Morton

Bernoulli Numbers Jeff Morton Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f

More information

Lecture 14: Quadrature

Lecture 14: Quadrature Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl

More information

Math 42 Chapter 7 Practice Problems Set B

Math 42 Chapter 7 Practice Problems Set B Mth 42 Chpter 7 Prctice Problems Set B 1. Which of the following functions is solution of the differentil eqution dy dx = 4xy? () y = e 4x (c) y = e 2x2 (e) y = e 2x (g) y = 4e2x2 (b) y = 4x (d) y = 4x

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below. Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we

More information

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of

More information

New data structures to reduce data size and search time

New data structures to reduce data size and search time New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

Review of Probability Distributions. CS1538: Introduction to Simulations

Review of Probability Distributions. CS1538: Introduction to Simulations Review of Proility Distriutions CS1538: Introduction to Simultions Some Well-Known Proility Distriutions Bernoulli Binomil Geometric Negtive Binomil Poisson Uniform Exponentil Gmm Erlng Gussin/Norml Relevnce

More information

Lect 11: Inbreeding, evolution at multiple loci. Exam 1, Monday, 2 October. Consequences of Inbreeding: Genotype frequencies

Lect 11: Inbreeding, evolution at multiple loci. Exam 1, Monday, 2 October. Consequences of Inbreeding: Genotype frequencies Lect 11: Inreeding, evolution t multiple loci Exm 1, Mondy, 2 Octoer Non-rndom mting-- Inreeding evolutionry consequences Synthesis: drift-migrtion: popultion structure Popultion genetics of pririe chickens

More information

The Wave Equation I. MA 436 Kurt Bryan

The Wave Equation I. MA 436 Kurt Bryan 1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string

More information

3.4 Numerical integration

3.4 Numerical integration 3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,

More information

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,

More information

Stuff You Need to Know From Calculus

Stuff You Need to Know From Calculus Stuff You Need to Know From Clculus For the first time in the semester, the stuff we re doing is finlly going to look like clculus (with vector slnt, of course). This mens tht in order to succeed, you

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

Interpreting Integrals and the Fundamental Theorem

Interpreting Integrals and the Fundamental Theorem Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of

More information

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (

More information

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

More information

Math 426: Probability Final Exam Practice

Math 426: Probability Final Exam Practice Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Statistical Physics I Spring Term Solutions to Problem Set #1

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Statistical Physics I Spring Term Solutions to Problem Set #1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Deprtment 8.044 Sttisticl Physics I Spring Term 03 Problem : Doping Semiconductor Solutions to Problem Set # ) Mentlly integrte the function p(x) given in

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

Vyacheslav Telnin. Search for New Numbers.

Vyacheslav Telnin. Search for New Numbers. Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which

More information

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner

More information

Monte Carlo method in solving numerical integration and differential equation

Monte Carlo method in solving numerical integration and differential equation Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The

More information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b

More information

APPROXIMATE INTEGRATION

APPROXIMATE INTEGRATION APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be

More information

Definition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim

Definition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)

More information

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by. NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with

More information

MAT 168: Calculus II with Analytic Geometry. James V. Lambers

MAT 168: Calculus II with Analytic Geometry. James V. Lambers MAT 68: Clculus II with Anlytic Geometry Jmes V. Lmbers Februry 7, Contents Integrls 5. Introduction............................ 5.. Differentil Clculus nd Quotient Formuls...... 5.. Integrl Clculus nd

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Reversals of Signal-Posterior Monotonicity for Any Bounded Prior

Reversals of Signal-Posterior Monotonicity for Any Bounded Prior Reversls of Signl-Posterior Monotonicity for Any Bounded Prior Christopher P. Chmbers Pul J. Hely Abstrct Pul Milgrom (The Bell Journl of Economics, 12(2): 380 391) showed tht if the strict monotone likelihood

More information

Lecture 20: Numerical Integration III

Lecture 20: Numerical Integration III cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed

More information

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties

More information

Series: Elementary, then Taylor & MacLaurin

Series: Elementary, then Taylor & MacLaurin Lecture 3 Series: Elementry, then Tylor & McLurin This lecture on series strts in strnge plce, by revising rithmetic nd geometric series, nd then proceeding to consider other elementry series. The relevnce

More information

Chapter 6 Notes, Larson/Hostetler 3e

Chapter 6 Notes, Larson/Hostetler 3e Contents 6. Antiderivtives nd the Rules of Integrtion.......................... 6. Are nd the Definite Integrl.................................. 6.. Are............................................ 6. Reimnn

More information

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a). The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples

More information

Chapter 14. Matrix Representations of Linear Transformations

Chapter 14. Matrix Representations of Linear Transformations Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn

More information

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either

More information

Numerical Integration

Numerical Integration Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the

More information

Lecture 2: January 27

Lecture 2: January 27 CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full

More information

different methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s).

different methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s). Mth 1A with Professor Stnkov Worksheet, Discussion #41; Wednesdy, 12/6/217 GSI nme: Roy Zho Problems 1. Write the integrl 3 dx s limit of Riemnn sums. Write it using 2 intervls using the 1 x different

More information