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

16S.BussandP.Cloteforall0≤i≤n.FromtheproofofLemma11,Mrk·ones≤(1 )kones.Itfollowsthatfort=rm+s,where0≤s<r,

E(t)=

≤t 1 i=0 Mi·ones≤ i<mrMi+Mmr· i<s Mi·ones irj(M)·(M)·ones+Mi·Mmr·ones

i<rj<mi<s ≤(Mi)·((1 )j)·ones+Mi·(1 )m·ones

≤1 i·(M)·ones i<r

(s)i<rj<mi<sThisprovidesanexplicitupperbound.Foreachi,thevaluesEi

limitEi(∞)formannondecreasingsequenceboundedabove,sothe=lims→∞Ei(s)exists.Applyinglimitstobothsidesofequation(6),itfollowsthatE(∞)satis es(4),hencebyProposition8,itmustbeequaltoD.Proposition13.LetM=(mi,j)satisfythemeanconditionandlet0andnbetheonlyabsorbingstates.SupposethatF0=0=Fnandthat,for0<i<n,Fi≥0and

Fi≥1+

ThenFi≥Diforall0≤i≤n.

Proof.Byinductionons≥0,weshowthatF≥E(s).ThisisclearforE(0),andintheinductivecase,by(7)wehaveF E(s+1)≥M·(F E(s)).TheentriesofMarenon-negative,soapplyingtheinductionhypothesis,theproofiscomplete.

FromLemmas12and13,thefollowingalgorithmisguaranteedtocorrectlycomputethemeanstoppingtimetoanyprecision .

Algorithm14.(MeanStoppingTime.)LetM=(mi,j)bethetransitionmatrixofaMarkovchainwhichsatis esthemeanconditionandforwhich0andnaretheonlyabsorbingstates.

=0.001;s=0;E=(0,0,...,0,0);finished=false

while(notfinished){

E =ones+ME;max=max0≤i≤n(Ei Ei) nj=0mi,jFj,(7)

if(max< ){//ifappeartohaveaccuracy

上一页第16页

TOP相关主题

你可能喜欢

热门文档

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