文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Applied Probability Trust (9 June 2004) SOLVING THE FISHER-WRIGHT AND COALESCENCE PROB- LEM
侵权投诉

Applied Probability Trust (9 June 2004) SOLVING THE FISHER-WRIGHT AND COALESCENCE PROB- LEM

We develop a new, self-contained proof that the expected number of generations required for gene allele fixation or extinction in a population of size n is O(n) under general assumptions. The proof relies on a discrete Markov chain analysis. We further dev

8S.BussandP.Clotehavesomereproductiveadvantage.Forexample,thiscanoccurwithhumaninterven-tion,wheree ortsaremadetopreserveararesubspecies;oritmightoccurifscarcityofthealleleconveyssomereproductiveadvantage.

Themeanconditionimpliesthat0andnareabsorbingstates.Theweakvariationconditionimpliesthatnootherstateisabsorbing.

Wecannowstateourmaintheoremsforpopulationswithtwoalleles.LetDidenotetheexpectedstoppingtimeforaMarkovchainstartedinstatei.(Didependsonbothiandn,butwesuppressthe“n”inthenotation.)

Theorem4.SupposetheMarkovchainM=(mi,j)satis esthemeanconditionandthevariationcondition.ThentheexpectedstoppingtimeDiisboundedby

Di=O(nH(i/n)),

whereH(p)= plnp (1 p)ln(1 p)istheentropyfunction.

Theorem5.SupposetheMarkovchainM=(mi,j)satis esthemeanconditionandtheweakvariationcondition.ThentheexpectedstoppingtimeDiisboundedby

Di=O(i(n i)).

Weprovethesetheoremsbelow,inSections4-6.First,however,Section3provesacorollaryaboutthenallelesituationandtheMRCA.

3.Themulti-allelecase

Thissectionextendstheexpectedstoppingtimetheoremstothecasewheretherearendistinctallelesinthepopulation.Fromthisitprovesupperboundsforexpectedtimetocoalescenceunderfairlygeneralconditions.

TheMarkovchainmodelgeneralizesstraightforwardlytomultiplealleles;namely,inthemulti-allelesetting,astateconsistsofthenumbersofindividualswitheachallele.Themeanconditionandtheweakvariationconditionneedtoberede nedtoapplymulti-allelleevolution.Forthis,letAbeanysetofalleles.LetnA(t)equalthenumberofindividualsingenerationtthatcarryanallelefromA.De nepAi,jtobetheconditionalprobability

pAi,j=Pr[nA(t+1)=j|nA(t)=i].

上一页第8页

TOP相关主题

你可能喜欢

热门文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email