Changeset - 702cfce575b3
[Not reviewed]
0 1 0
Tom Bannink - 8 years ago 2017-06-14 12:59:42
tom.bannink@cwi.nl
Add a^{(n)}_k formula for n=4,5
1 file changed with 11 insertions and 0 deletions:
0 comments (0 inline, 0 general)
main.tex
Show inline comments
 
@@ -182,12 +182,23 @@
 
                    = \frac{(1-q)(1+q+q^2+3q^3)}{6q^4}\\
 
        R^{(5)}(p) &= \frac{p(90-300p+435p^2-325p^3+136p^4-36p^5+6p^6)}{15(1-p)^5(6-2p+p^2)}\\
 
                   &= \frac{(1-q)(6+5q+6q^2+21q^3+46q^4+6q^6)}{15q^5(5+q^2)}
 
    \end{align*}
 
    For $n=3$ the system becomes very simple because regardless of the current state, the probability of going to $111$ is always equal to $(1-p)^3$. Therefore the expected number of resamplings is simply the expectation of a geometric distribution. This gives the formula for $R^{(3)}(p)$ as shown above. Note that the $k$-th coefficient of the powerseries of a function $f(p)$ is given by $\frac{1}{k!}\left.\frac{d^k f}{dp^k}\right|_{p=0}$, i.e. the $k$-th derivative to $p$ evaluated at $0$ divided by $k!$. For the function $R^{(3)}(p) = (1-p)^{-3} - 1$ this yields $a^{(3)}_k = (k+2)(k+1)/6$ for $k\geq 1$ and $a^{(3)}_0=0$.
 

	
 
    We can do the same for $n=4,5$, which gives, for $k\geq 1$ (with Mathematica):
 
    \begin{align*}
 
        a^{(3)}_k &= \frac{(k+2)(k+1)}{6}\\
 
        a^{(4)}_k &= \frac{1}{6}\left(2+\frac{(k+3)(k+2)(k+1)}{6}\right)\\
 
        a^{(5)}_k &= \frac{1}{15}\left(\frac{(k+4)(k+3)(k+2)(k+1)}{20} - \frac{(k+3)(k+2)(k+1)}{30} - \frac{(k+2)(k+1)}{50} + \frac{76(k+1)}{25}\right.\\
 
                  &  \qquad\quad \left. + \frac{626}{125} - \frac{4}{250}
 
                  \left( \left(\frac{1+i\sqrt{5}}{6}\right)^k(94-25\sqrt{5}i)+\left(\frac{1-i\sqrt{5}}{6}\right)^k(94+25\sqrt{5}i) \right)
 
                  \right)
 
    \end{align*}
 
    and from $n=6$ and onwards, the expression becomes complicated and Mathematica can only give expressions including roots of polynomials.
 

	
 
    ~
 

	
 
	If statements \ref{it:pos}-\ref{it:lim} are true, then we can define the function 
 
	$$R^{(\infty)}(p):=\sum_{k=0}^{\infty}a^{(k+1)}_k p^k,$$
 
	which would then have radius of convergence $p_c$, also it would satisfy for all $p\in[0,p_c)$ that $R^{(n)}(p)\leq R^{(\infty)}(p)$ and $\lim\limits_{n\rightarrow\infty}R^{(n)}(p)=R^{(\infty)}(p)$.
 
	It would also imply, that for all $p\in(p_c,1]$ we get $R^{(n)}(p)=\Omega\left(\left(\frac{p}{p_c}\right)^{n/2}\right)$.
0 comments (0 inline, 0 general)