文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 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

Fisher-Wrightandcoalescenceproblems5theO(n)coalescenttheorem,basedonthemeanandweakvariationconditionsplusanadditionalassumptionthatletsusde nethetime-reversalofanevolutionaryprocess.Forinstance,thebinomialandhypergeometricprocesses,aswellthegeneralizedbi-nomialandhypergeometricprocessesofM¨ohle[20],areprovedtohaveO(n)expectednumberofgenerationsbeforeaMRCAisreached.Unlikeearlierproofs,ourproofisbasedontheforwardabsorptiontimesoftheFisher-Wrightproblem,ratherthanonananalysisofthedeathprocess.

2.Preliminariesandde nitions

Werestrictattentiontohaploidindividuals,whocarryasinglesetofgeneticmaterialandreceivetheirgenesfromasingleparent.However,ourresultscanapplytodiploidgenesaswell,aslongasthegenesarenotsex-orreproduction-linked.Weassumethereisnomutationandthattheevolutionaryprocessistime-homogeneous.

Thepopulationsareassumedtoconsistofdiscrete,non-overlappinggenerations,eachofsizen.Eachindividualcarriesoneoftwoalleles,Aora.IfiindividualsofagenerationhavealleleA,thenn ihavealleleaandthegenerationisin“statei.”ThepopulationismodeledbyaMarkovchain(Q,M),whereQ={0,1,2,...,n}isthesetofstatesandM=(mi,j)isaastochastictransitionmatrix.Thetransitionprobabilitymi,jistheprobabilitythatstateiisfollowedimmediatelybystatej.WeoftendroptheQfromthenotationandrefertoMasaMarkovchain.

Wehavem0,0=1andmn,n=1sincethestates0andnareabsorbingstateswherealltheindividualscarryingthesameallele.TheMarkovchaincanbeviewedasstoppingonceitentersoneofthesetwostates.Themeanstoppingtimeortheexpectedabsorptiontimeistheexpectednumberofgenerationsuntilanabsorbingstateisreached.Themeanstoppingtimeisafunctionoftheinitialstate.

TheFisher-Wrightproblemconcernsboundingthemeanstoppingtime.Forthetra-ditionalFisher-Wrightproblem,thetransitionprobabilitiesarede nedbymi,j=pi,jwherethepi,j’sarede nedin(1).Sometimes,theprobabilitiesqi,jfromequation(2)areusedinstead.Togeneralizetoawiderrangeoftransitionprobabilities,wede neameanconditionandtwoconditionsonthevarianceoftheprobabilities.

De nition1.AMarkovchainsatis esthemeanconditionif,foralln≥3andforall

上一页第5页

TOP相关主题

你可能喜欢

热门文档

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