|
|
| Line 1: |
Line 1: |
| {{Unreferenced|date=March 2011}}
| |
|
| |
|
| A '''Moran process''' or '''Moran model''' is a simple [[stochastic process]] used in [[biology]] to describe [[Wikt:finite|finite]] populations named after [[Pat Moran (statistician)|Patrick Moran]] who first proposed the model in 1958.<ref>{{cite doi|10.1017/S0305004100033193}}</ref>
| |
| It can be used to model variety-increasing processes such as [[mutation]] as well as variety-reducing effects such as [[genetic drift]] and [[natural selection]]. The process can describe the probabilistic dynamics in a finite population of constant size ''N'' in which two [[allele]]s A and B are competing for dominance. The two alleles are considered to be true [[replicator]]s (i.e. entities that make copies of themselves). In each time step a random individual (which is of either type A or B) is chosen for reproduction and a random individual is chosen for death; thus ensuring that the population size remains constant. To model selection, one type has to have a higher fitness and is thus more likely to be chosen for reproduction.
| |
| The same individual can be chosen for death and for reproduction in the same step.
| |
|
| |
|
| ==Neutral drift==
| | If you have become ill from exposure to asbestos, then you might be seeking to take appropriate action. If you are interested in protection, you will seemingly need to learn about [http://scriptogr.am/tourlosrvf privacy]. "Do I want a Lawyer," or "What kind of Lawyer Should I Hire", In that case you may be asking the question to yourself? Legalities are difficult, and you need to make a decision if you"re going to fly solo, o-r have a lawyer represent you. <br><br>First off, you"ll need a lawyer if you want to win a lawsuit in a asbestos case, but the good news is that if you situations meet with the qualifications then you could get a lawyer and never having to pay anything out of pocket. They"ll get paid after the situation is gained. <br><br>Minute, you"re going to have to locate a lawyer that specializes in asbestos cases, and features a strong background of winning cases. When you enter that courtroom and all eyes are on you. A lawyer that is specialized in winning cases that deal with asbestos is going to make all the difference on the planet since they will have answer to the difficult questions, and will have an idea to as to what type of questions opposing counsel is going to ask. This tasteful [http://www.purevolume.com/losangelesbfg/posts/7840511/Should+you%27ve+an+for+a+ los angeles wage garnishments lawyer] article directory has limitless pictorial lessons for where to deal with this concept. An excellent lawyer is the difference between winning and losing, so be sure to take you time and make sure you find the correct attorney to represent you. <br><br>In closing if you"re trying to get your asbestos situation then you are going to desire a tough attorney that is willing to fight for you, and has a history of coping with these particular circumstances. I believe when you have the right lawyer, then you will be on your solution to the arrangement that you deserve for the injury..<br><br>If you have any questions relating to the place and how to use [http://accidentalscene86.jimdo.com health forums], you can get in touch with us at our own webpage. |
| Neutral drift is the idea that a [[neutral mutation]] can spread throughout a population, so that eventually the original [[allele]] is lost. A neutral mutation does not bring any [[Fitness (biology)|fitness]] advantage or disadvantage to its bearer. The simple case of the Moran process can describe this phenomenon.
| |
| | |
| If the number of A individuals is given by ''i'' then the Moran process is defined on the state space ''i'' = 0, ..., ''N''. Since the number of A individuals can change at most by one at each time step, a transition exists only between state ''i'' and state ''i'' − 1, ''i'' and ''i'' + 1. Thus the [[transition matrix]] of the stochastic process is [[Tridiagonal matrix|tri-diagonal]] in shape and the transition probabilities are | |
| | |
| : <math> \begin{align}
| |
| P_{0,0}&=1\\
| |
| P_{i,i-1} &= \frac{N-i}{N} \frac{i}{N}\\
| |
| P_{i,i} &= 1- P_{i,i-1} - P_{i,i+1}\\
| |
| P_{i,i+1} &= \frac{i}{N} \frac{N-i}{N}\\
| |
| P_{N,N}&=1.
| |
| \end{align}</math>
| |
| | |
| The entry <math>P_{i,j}</math> denotes the probability to go from state ''i'' to state ''j''. To understand the formulas for the transition probabilities one has to look at the definition of the process which states that always one individual will be chosen for reproduction and one is chosen for death. Once the A individuals have died out, they will never be reintroduced into the population since the process does not model [[mutation]]s (A cannot be reintroduced into the population once it has died out and ''vice versa'') and thus <math>P_{0,0}=1</math>. For the same reason the population of A individuals will always stay ''N'' once they have reached that number and taken over the population and thus <math>P_{N,N}=1</math>. The states 0 and ''N'' are called ''absorbing'' while the states 1, ..., ''N'' − 1 are called ''transient''. The intermediate transition probabilities can be explained by considering the first term to be the probability to choose the individual whose abundance will increase by one and the second term the probability to choose the other type for death. Obviously, if the same type is chosen for reproduction and for death, then the abundance of one type does not change.
| |
| | |
| Eventually the population will reach one of the absorbing states and then stay there forever. In the transient states, random fluctuations will occur but eventually the population of A will either go extinct or reach fixation. This is one of the most important differences to deterministic processes which cannot model random events.
| |
| The [[expected value]] and the [[variance]] of the number of A individuals ''X(t)'' at timepoint ''t'' can be computed when an initial state ''X(0) = i'' is given:
| |
| | |
| : <math> \begin{align}
| |
| E[X(t)|X(0) = i] &= i \\
| |
| Var(X(t)|X(0) = i) &= 2i/N(1-i/N) \frac{1-(1-2/N^2)^t}{2/N^2}
| |
| \end{align}</math>
| |
| {{hidden|bg1=#f2dfce;|contentcss=border:1px #C4C3D0solid; |headercss=color:black; |header=For a mathematical derivation of the equation above, click on "show" to reveal|content=
| |
| | |
| For the expected value the calculation runs as follows. Writing <math>p = i/N,</math>
| |
| | |
| : <math> \begin{align}
| |
| E [X(t) | X(t-1) = i] &= (i-1)P_{i,i-1} + iP_{i,i} + (i+1)P_{i,i+1}\\
| |
| &= 2ip(1-p) + i(p^2 + (1-p)^2) \\ | |
| &= i.
| |
| \end{align}</math>
| |
| | |
| Writing <math>Y = X(t)</math> and <math>Z = X(t-1)</math>, and applying the [[law of total expectation]], <math>E[Y] = E[E[Y|Z]] = E[Z].</math> Applying the argument repeatedly gives <math>E[X(t)] = E[X(0)],</math> or <math>E[X(t)|X(0) = i] = i.</math>
| |
| | |
| For the variance the calculation runs as follows. Writing <math>V_t = Var(X(t)|X(0) = i),</math> we have
| |
| : <math> \begin{align}
| |
| V_1 &= E[X(1)^2|X(0) = i] - E[X(1)|X(0)=i]^2 \\
| |
| &= (i-1)^2p(1-p) + i^2(p^2+(1-p)^2) + (i+1)^2p(1-p) - i^2 \\
| |
| &= 2p(1-p).
| |
| \end{align}</math>
| |
| | |
| For all t, <math>(X(t)|X(t-1) = i)</math> and <math>(X(1)|X(0) = i)</math> are identically distributed, so their variances are equal. Writing as before <math>Y = X(t)</math> and <math>Z = X(t-1)</math>, and applying the [[law of total variance]],
| |
| : <math> \begin{align}
| |
| Var(Y) &= E[Var(Y|Z)] + Var(E[Y|Z]) \\
| |
| &= E[(2Z/N)(1-Z/N)] + Var(Z)\\
| |
| &= (2E[Z]/N)(1-E[Z]/N) + (1-2N^2)Var(Z).
| |
| \end{align}</math>
| |
| If <math>X(0) = i</math>, we obtain <math>V_t = V_1 + (1-2/N^2)V_{t-1}</math>. Rewriting this equation as
| |
| : <math> V_t - \frac{V_1}{2/N^2} = (1-2/N^2)\left(V_{t-1}-\frac{V_1}{2/N^2}\right) = (1-2/N^2)^{t-1}\left(V_1-\frac{V_1}{2/N^2}\right) </math>
| |
| yields
| |
| : <math> V_t = V_1 \frac{1-(1-2/N^2)^t}{2/N^2} </math>
| |
| as desired.
| |
| ----
| |
| }}
| |
| | |
| The probability of A to reach fixation is called ''fixation probability''. For the simple Moran process this probability is
| |
| | |
| : <math> \begin{align}
| |
| x_i = \frac{i}{N}.
| |
| \end{align}</math>
| |
| | |
| Since all individuals have the same fitness, they also have the same chance of becoming the ancestor of the whole population; this probability is ''1 / N'' and thus the sum of all ''i'' probabilities (for all A individuals) is just ''i / N''.
| |
| The mean time to absorption starting in state ''i'' is given by
| |
| | |
| : <math> \begin{align}
| |
| k_i = N \left[ \sum\limits_{j=1}^{i} \frac{N-i}{N-j} + \sum\limits_{j=i+1}^{N-1} \frac{i}{j} \right]
| |
| \end{align}</math>
| |
| {{hidden|bg1=#f2dfce;|contentcss=border:1px #C4C3D0solid; |headercss=color:black; |header=For a mathematical derivation of the equation above, click on "show" to reveal|content=
| |
| | |
| The mean time spent in state ''j'' when starting in state ''i'' which is given by
| |
| | |
| : <math> \begin{align}
| |
| k_i^j = \delta_{ij}+P_{i,i-1}k_{i-1}^j + P_{i,i}k_{i}^j + P_{i,i+1}k_{i+1}^j
| |
| \end{align}</math>
| |
| | |
| Here <math>\delta_{ij}</math> denotes the [[Kroenecker delta]]. This [[Recurrence relation|recursive equation]] can be solved using a new variable <math>q_i</math> so that <math>P_{i,i-1} = P_{i,i+1} = q_i</math> and thus <math>P_{i,i} = 1-2 q_i</math> and rewritten
| |
| | |
| : <math> \begin{align} | |
| k_{i+1}^j &= 2 k_{i}^j- k_{i-1}^j -\frac{\delta_{ij}}{q_i}
| |
| \end{align}</math>
| |
| | |
| The variable <math>y_i^{j} = k_{i}^j- k_{i-1}^j</math> is used and the equation becomes
| |
| | |
| : <math> \begin{align}
| |
| y_{i+1}^{j} &= y_i^{j} -\frac{\delta_{ij}}{q_i} \\
| |
| \sum\limits_{i=1}^m y_i^{j} &= (k_{1}^j- k_{0}^j) + (k_{2}^j- k_{1}^j) + \cdots + (k_{m-1}^j- k_{m-2}^j) + (k_{m}^j- k_{m-1}^j) \\
| |
| &= k_{m}^j - k_{0}^j \\
| |
| \sum\limits_{i=1}^m y_i^{j} &= k_{m}^j \\ \\
| |
| y_1^{j} &= (k_{1}^j- k_{0}^j) = k_{1}^j \\
| |
| y_2^{j} &= y_1^{j} -\frac{\delta_{1j}}{q_1} = k_1^{j} -\frac{\delta_{1j}}{ q_1 } \\
| |
| y_3^{j} &= k_1^{j} -\frac{\delta_{1j}}{q_1} -\frac{\delta_{2j}}{ q_2 } \\
| |
| & \; \vdots \\
| |
| y_i^{j} &= k_1^{j} -\sum\limits_{r=1}^{i-1} \frac{\delta_{rj}}{ q_r}
| |
| \quad = \quad
| |
| \left\{
| |
| \begin{array}{lcr}
| |
| k_1^j & \text{for} & j \geq i\\
| |
| k_1^j - \frac{1}{q_j} & \text{for} & j \leq i
| |
| \end{array} \right. \\
| |
| k_i^j &= \quad \quad \; \sum\limits_{m=1}^i y_m^{j} \quad = \quad
| |
| \left\{
| |
| \begin{array}{lcr}
| |
| i \cdot k_1^j & \text{for} & j \geq i\\
| |
| i \cdot k_1^j - \frac{i-j}{q_j} & \text{for} & j \leq i
| |
| \end{array} \right.
| |
| \end{align}</math>
| |
| Now <math>k_1^j</math> can be calculated, knowing that <math>k_N^j = 0</math> and <math>q_j = P_{j,j+1}=\frac{j}{N} \frac{N-j}{N}</math>
| |
| : <math> \begin{align}
| |
| k_N^j = \sum\limits_{i=1}^m y_i^{j} = N \cdot k_1^j &- \frac{N-j}{q_j} = 0 \\
| |
| k_1^j &= \frac{N}{j}
| |
| \end{align}</math>
| |
| | |
| Therefore
| |
| | |
| : <math> \begin{align}
| |
| k_i^j \quad = \quad
| |
| \left\{
| |
| \begin{array}{lcr}
| |
| \frac{i}{j} \cdot k_j^j & \text{for} & j \geq i\\
| |
| \frac{N - i}{N-j} \cdot k_j^j & \text{for} & j \leq i
| |
| \end{array} \right.
| |
| \end{align}</math>
| |
| | |
| with <math>k_j^j = N</math>. Now <math>k_i</math>, the total time until fixation starting from state ''i'', can be calculated
| |
| | |
| : <math> \begin{align}
| |
| k_i = \sum\limits_{j=1}^{N-1}k_i^j &= \sum\limits_{j=1}^{i}k_i^j + \sum\limits_{j=i+1}^{N-1}k_i^j \\
| |
| &= \sum\limits_{j=1}^{i}N \frac{N-i}{N-j} + \sum\limits_{j=i+1}^{N-1}N \frac{i}{j}
| |
| \end{align}</math>
| |
| ----
| |
| }}
| |
| For large ''N'' the approximation
| |
| | |
| : <math> \begin{align}
| |
| \lim \limits_{N\rightarrow \infty} k_i \approx -N^2 \left[ (1-p) \ln(1-p) + p \ln(p) \right]
| |
| \end{align}</math>
| |
| holds.
| |
| | |
| ==Selection==
| |
| If one allele has a [[Fitness (biology)|fitness advantage]] over the other allele, it will be more likely to be chosen for reproduction. This can be incorporated into the model if individuals with [[allele]] A have fitness <math>f_i</math> and individuals with [[allele]] B have fitness <math>g_i</math> where ''i'' is the number of individuals of type A; thus describing a general birth-death process.
| |
| The [[transition matrix]] of the stochastic process is [[Tridiagonal matrix|tri-diagonal]] in shape and the transition probabilities are
| |
| : <math> \begin{align}
| |
| P_{0,0}&=1\\
| |
| P_{i,i-1} &= \frac{g_i (N-i) }{f_i \cdot i + g_i (N-i)} \cdot \frac{i}{N}\\
| |
| P_{i,i} &= 1- P_{i,i-1} - P_{i,i+1}\\
| |
| P_{i,i+1} &= \frac{f_i \cdot i}{f_i \cdot i + g_i (N-i)} \cdot \frac{N-i}{N}\\
| |
| P_{N,N}&=1.
| |
| \end{align}</math>
| |
| The entry <math>P_{i,j}</math> denotes the probability to go from state ''i'' to state ''j''. To understand the formulas for the transition probabilities one has to look again at the definition of the process and see that the fitness enters only the first term in the equations which is concerned with reproduction. Thus the probability that individual A is chosen for reproduction is not ''i / N'' any more but dependent on the fitness of A and thus <math>f_i \cdot i / (f_i \cdot i + g_i (N-i) )</math>. Also in this case, fixation probabilities when starting in state ''i'' is defined by recurrence
| |
| : <math> \begin{align}
| |
| x_0 &= 0\\
| |
| x_i &= \beta_i x_{i-1}+(1-\alpha_i-\beta_i)x_i+\alpha_ix_{i+1}\quad i=1,\dots,N-1\\
| |
| x_N &= 1
| |
| \end{align}</math>
| |
| And the closed form is given by
| |
| : <math> \begin{align}
| |
| x_i = \frac{
| |
| {\displaystyle
| |
| 1 + \sum\limits_{j=1}^{i-1}\prod\limits_{k=1}^{j}\gamma_k } }
| |
| { {\displaystyle
| |
| 1 + \sum\limits_{j=1}^{N-1}\prod\limits_{k=1}^{j}\gamma_k } }
| |
| \qquad \text{(1)}
| |
| \end{align}</math>
| |
| where <math>\gamma_i = P_{i,i-1} / P_{i,i+1}</math> per definition and will just be <math>g_i / f_i</math> for the general case.
| |
| {{hidden|bg1=#f2dfce;|contentcss=border:1px #C4C3D0solid; |headercss=color:black; |header=For a mathematical derivation of the equation above, click on "show" to reveal|content=Also in this case, fixation probabilities can be computed, but the transition probabilities are not symmetric. The notation <math>P_{i,i+1}=\alpha_i</math>, <math>P_{i,i-1}=\beta_i</math>, <math>P_{i,i}=1-\alpha_i- \beta_i</math> and <math>\gamma_i = \beta_i / \alpha_i</math> is used. The fixation probability can be defined recursively and a new variable <math>y_i = x_i - x_{i-1}</math> is introduced.
| |
| : <math> \begin{align}
| |
| x_i &= \beta_i x_{i-1} + (1-\alpha_i - \beta_i)x_i + \alpha_i x_{i+1} \\
| |
| \beta_i (x_i - x_{i-1} ) &= \alpha_i (x_{i+1} - x_i ) \\
| |
| \gamma_i \cdot y_i &= y_{i+1}
| |
| \end{align}</math>
| |
| Now two properties from the definition of the variable <math>y_i</math> can be used to find a closed form solution for the fixation probabilities:
| |
| : <math> \begin{align}
| |
| \sum\limits_{i=1}^{m} y_i &= x_m &1\\
| |
| y_k &= x_1 \cdot \prod\limits_{l=1}^{k-1}\gamma_l &2\\
| |
| \Rightarrow \sum\limits_{m=1}^{i}y_m &= x_1 + x_1 \sum\limits_{j=1}^{i-1}\prod\limits_{k=1}^{j}\gamma_k = x_i &3
| |
| \end{align}</math>
| |
| From (3) and the knowledge <math>x_N = 1</math> follows
| |
| : <math> \begin{align}
| |
| x_N = x_1 \left( 1 + \sum\limits_{j=1}^{N-1}\prod\limits_{k=1}^{j}\gamma_k \right) &= 1 \quad \Rightarrow \quad
| |
| x_1 = \frac{1}{ 1 + \sum\limits_{j=1}^{N-1}\prod\limits_{k=1}^{j}\gamma_k } \\
| |
| x_i &= \frac{
| |
| {\displaystyle
| |
| 1 + \sum\limits_{j=1}^{i-1}\prod\limits_{k=1}^{j}\gamma_k } }
| |
| { {\displaystyle
| |
| 1 + \sum\limits_{j=1}^{N-1}\prod\limits_{k=1}^{j}\gamma_k } }
| |
| \end{align}</math>
| |
| ----
| |
| }}
| |
| This general case where the fitness of A and B depends on the abundance of each type is studied in [[evolutionary game theory]].
| |
| | |
| Less complex results are obtained if a constant fitness difference ''r'' is assumed. Individuals of type A reproduce with a constant rate ''r'' and individuals with allele B reproduce with rate 1. Thus if A has a fitness advantage over B, ''r'' will be larger than one, otherwise it will be smaller than one.
| |
| Thus the [[transition matrix]] of the stochastic process is tri-diagonal in shape and the transition probabilities are
| |
| : <math> \begin{align}
| |
| P_{0,0}&=1\\
| |
| P_{i,i-1} &= \frac{N-i}{r \cdot i + N-i} \cdot \frac{i}{N}\\
| |
| P_{i,i} &= 1- P_{i,i-1} - P_{i,i+1}\\
| |
| P_{i,i+1} &= \frac{r \cdot i}{r \cdot i + N-i} \cdot \frac{N-i}{N}\\
| |
| P_{N,N}&=1.
| |
| \end{align}</math>
| |
| In this case <math>\gamma_i = 1/r</math> is a constant factor for each composition of the population and thus the fixation probability from equation (1) simplifies to
| |
| : <math> \begin{align}
| |
| x_i = \frac{1-r^{-i}} { 1-r^{-N} }
| |
| \quad \Rightarrow \quad
| |
| x_1 = \rho = \frac{1-r^{-1}} { 1-r^{-N} }
| |
| \qquad \text{(2)}
| |
| \end{align}</math>
| |
| where the fixation probability of a single mutant ''A'' in a population of otherwise all ''B'' is often of interest and is denoted by <math>\rho</math>.
| |
| | |
| Also in the case of selection, the expected value and the variance of the number of ''A'' individuals may be computed
| |
| : <math> \begin{align}
| |
| E [ X(t) | X(t-1) = i ] &= p s \dfrac{1-p}{p s + 1} + i \\
| |
| Var( X(t+1) | X(t)=i) &=p(1-p)\dfrac{ (s+1) + (p s + 1)^2 }{(p s +1)^2}
| |
| \end{align}</math>
| |
| where ''p'' = ''i''/''N'' and ''r'' = 1 + ''s''.
| |
| {{hidden|bg1=#f2dfce;|contentcss=border:1px #C4C3D0solid; |headercss=color:black; |header=For a mathematical derivation of the equation above, click on "show" to reveal|content=
| |
| For the expected value the calculation runs as follows
| |
| : <math> \begin{align}
| |
| E [ \Delta(1) | X(0) = i ]
| |
| &= (i-1-i) \cdot P_{i,i-1} + (i-i) \cdot P_{i,i} + (i+1-i) \cdot P_{i,i+1} \\
| |
| &= - \frac{N-i}{r i + N -i} \frac{i}{N} + \frac{ri}{r i + N -i} \frac{N-i}{N} \\
| |
| &= - \frac{(N-i)i}{(r i + N -i)N} + \frac{i(N-i)}{(r i + N -i)N} + \frac{si(N-i)}{(r i + N -i)N} \\
| |
| &= p s \dfrac{1-p}{p s + 1}\\
| |
| E [ X(t) | X(t-1) = i ] &= p s \dfrac{1-p}{p s + 1}+i
| |
| \end{align}</math>
| |
| For the variance the calculation runs as follows, using the variance of a single step
| |
| : <math> \begin{align}
| |
| Var( X(t+1) | X(t)=i) &= Var(X(t)) + Var(\Delta(t+1)| X(t)=i)\\
| |
| &= 0 + E[\Delta(t+1)^2| X(t)=i] - E[\Delta(t+1)| X(t)=i]^2\\
| |
| &= (i-1-i)^2 \cdot P_{i,i-1} + (i-i)^2 \cdot P_{i,i} + (i+1-i)^2 \cdot P_{i,i+1} - E[\Delta(t+1)| X(t)=i]^2\\
| |
| &= P_{i,i-1} + P_{i,i+1} - E[\Delta(t+1)| X(t)=i]^2\\
| |
| &= \frac{(N-i)i}{(r i + N -i)N} + \frac{(N-i)i(1+s)}{(r i + N -i)N} - E[\Delta(t+1)| X(t)=i]^2\\
| |
| &= i (N-i)\frac{2+s }{(r i + N -i)N} - E[\Delta(t+1)| X(t)=i]^2\\
| |
| &= i (N-i)\frac{2+s }{(r i + N -i)N} - (p s \dfrac{1-p}{p s + 1})^2\\
| |
| &= p(1-p)\frac{2+s (p s + 1)}{(p s + 1)^2} - p(1-p) \frac{p s^2(1-p)}{(p s + 1)^2}\\
| |
| &= p(1-p)\dfrac{2+2 p s + s + p^2 s^2 }{(p s +1)^2}
| |
| \end{align}</math>
| |
| ----
| |
| }}
| |
| | |
| == Rate of evolution ==
| |
| | |
| In a population of all ''B'' individuals, a single mutant ''A'' will take over the whole population with the probability
| |
| | |
| : <math>\rho = \frac{1-r^{-1}} { 1-r^{-N} }. \qquad \text{(2)} </math>
| |
| | |
| If the [[mutation rate]] (to go from the ''B'' to the ''A'' allele) in the population is ''u'' then the rate with which one member of the population will mutate to ''A'' is given by ''N'' x ''u'' and the rate with which the whole population goes from all ''B'' to all ''A'' is the rate that a single mutant ''A'' arises times the probability that it will take over the population (''fixation probability''): | |
| | |
| : <math> \begin{align}
| |
| | |
| R = N \cdot u \cdot \rho = u \quad \text{if} \quad \rho = \frac{1}{N}.
| |
| \end{align}</math>
| |
| | |
| Thus if the mutation is neutral (i.e. the ''fixation probability'' is just 1/''N'') then the rate with which an allele arises and takes over a population is independent of the population size and is equal to the mutation rate. This important result is the basis of the [[neutral theory of evolution]] and suggests that the number of observed point mutations in the [[genome]]s of two different [[species]] would simply be given by the mutation rate multiplied by two times the time since [[divergence]]. Thus the neutral theory of evolution provides a [[molecular clock]], given that the assumptions are fulfilled which may not be the case in reality.
| |
| | |
| ==Literature==
| |
| *Nowak, Martin A: ''Evolutionary Dynamics: Exploring the Equations of Life''. Belknap Press (2006) ISBN 978-0-674-02338-3
| |
| *Moran, Patrick Alfred Pierce: ''The Statistical Processes of Evolutionary Theory''. Oxford, Clarendon Press (1962).
| |
| | |
| ==External links==
| |
| * [http://www.univie.ac.at/virtuallabs/Moran/ Evolutionary dynamics on graphs]
| |
| | |
| ==References==
| |
| {{Reflist}}
| |
| | |
| {{Stochastic processes}}
| |
| | |
| [[Category:Evolutionary dynamics]]
| |
| [[Category:Stochastic processes]]
| |
| [[Category:Population genetics]]
| |