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
热门文档