Changeset - 7b239b9b9891
[Not reviewed]
0 1 0
Tom Bannink - 8 years ago 2017-09-10 22:42:04
tombannink@gmail.com
Fix typo in equation
1 file changed with 1 insertions and 1 deletions:
0 comments (0 inline, 0 general)
main.tex
Show inline comments
 
@@ -700,49 +700,49 @@ The following Lemma says that if a set $S$ splits the graph in two, then those t
 
    Instead of choosing a step in $Y,X,X,Y,\cdots$ we could have chosen other orderings. The following diagram illustrates all possible interleavings, and the red line corresponds to the particular interleaving $Y,X,X,Y$ in the example above.
 
    \begin{center}
 
        \includegraphics{diagram_paths3.pdf}
 
    \end{center}
 
    For the labels shown within the grid, define $p_{ij} = \frac{z^X_i}{z^X_i + z^Y_j}$.
 
    The probability of this particular interleaving $\xi^G$ is given by
 
    \begin{align*}
 
        \P^{G}_S(\xi^{G})
 
        &= (1-p)^{|b^X\; b^Y|} p^{|X\cup Y|-|b^X\;b^Y|} \quad
 
        \frac{1}{z^X_1+z^Y_1} \P(r^Y_1) \cdot
 
        \frac{1}{z^X_1+z^Y_2} \P(r^X_1) \cdots \\
 
        &= (1-p)^{|b^X|} p^{|X|-|b^X|} \cdot (1-p)^{|b^Y|} p^{|Y|-|b^Y|} \\
 
        &\qquad \cdot
 
        \frac{z^Y_1}{z^X_1+z^Y_1} \frac{1}{z^Y_1} \P(r^Y_1) \;
 
        \frac{z^X_1}{z^X_1+z^Y_2} \frac{1}{z^X_1} \P(r^X_1) \;
 
        \frac{z^X_2}{z^X_2+z^Y_2} \frac{1}{z^X_2} \P(r^X_2)
 
        \cdots \tag{rewrite fractions}\\
 
        &=
 
        \frac{z^Y_1}{z^X_1+z^Y_1} 
 
        \frac{z^X_1}{z^X_1+z^Y_2} 
 
        \frac{z^X_2}{z^X_2+z^Y_2} 
 
        \cdots
 
        \P^{G\setminus Y}_S(\xi^{G\setminus Y}) \; \P^{G\setminus X}_S(\xi^{G\setminus X})
 
        \tag{definition} \\
 
        &= (1-p_{1,1}) \; p_{1,2} \; p_{2,2} \; (1-p_{3,2}) \; \P^{G\setminus Y}_S(\xi^{G\setminus Y}) \; \P^{G\setminus X}_S(\xi^{G\setminus X})
 
        &= (1-p_{1,1}) \; p_{1,2} \; p_{2,2} \; (1-p_{3,2}) \cdots \P^{G\setminus Y}_S(\xi^{G\setminus Y}) \; \P^{G\setminus X}_S(\xi^{G\setminus X})
 
        \tag{definition of $p_{i,j}$} \\
 
        &= \P(\text{path in grid}) \; \P^{G\setminus Y}_S(\xi^{G\setminus Y}) \; \P^{G\setminus X}_S(\xi^{G\setminus X})
 
    \end{align*}
 
    In the grid we see that at every point the probabilities sum to 1, and we always reach the end, so we know the sum of all paths in the grid is 1. This proves the required equality.
 
    We obtain
 
    \begin{align*}
 
        \P^{G}_S(\NZ{S} \cap A^X \cap A^Y)
 
        &= \sum_{\xi^G \in \NZ{S}\cap A^X \cap A^Y} \P^{G}_S(\xi^G) \\
 
        &= \sum_{\xi^{G\setminus Y} \in \NZ{S}\cap A^X}
 
           \sum_{\xi^{G\setminus X} \in \NZ{S}\cap A^Y}
 
            \P^{G\setminus Y}_S(\xi^{G\setminus Y}) \cdot
 
            \P^{G\setminus X}_S(\xi^{G\setminus X}) \\
 
        &= \P^{G\setminus Y}_S(\NZ{S} \cap A^X) \; \cdot \; \P^{G\setminus X}_S(\NZ{S} \cap A^Y)
 
    \end{align*}
 
\end{proof}
 

	
 
\todo{rewrite from here}
 
\begin{lemma}[Conditional independence 2] \label{lemma:eventindependenceNewGen}
 
	Let $v,w \in [n]$, and let $A$ be any event that depends only on the sites $[v,w]$ (meaning the initialization and resamples) and similarly $B$ an event that depends only on the sites $[w,v]$. (For example $\mathrm{Z}^{(s)}$ or ``$s$ has been resampled at least $k$ times'' for an $s$ on the correct interval). Then we have
 
	\begin{align*}
 
		\P^{(n)}(\mathrm{NZ}^{(v,w)}\cap A\cap B)
 
		=
 
		\P_{b_v=b_w=1}^{[v,w]}(\mathrm{NZ}^{(v,w)}\cap A)
 
		\; \cdot \;
0 comments (0 inline, 0 general)