AENC/resampling_chain Changeset - 4b9c6dda1fec · Centrum Wiskunde & Informatica (CWI)

Changeset - 4b9c6dda1fec

Parent rev.

Child rev.

[Not reviewed]

0 1 0

Tom Bannink - 8 years ago 2017-09-08 14:27:23
tom.bannink@cwi.nl

Correct typo

1 file changed with 1 insertions and 1 deletions:

main.tex

0 comments (0 inline, 0 general)

main.tex

➞

Show inline comments

 	\begin{definition}[Connected patches]
 		Let $P\subseteq V$ be a connected component of $G$. We say that $P$ is a patch of a particular run of the process if $P$ is a maximal connected component of the vertices that have ever become $0$ before termination. We denote the set of patches of a run by $\mathcal{P}$. For a patch $P$ let $P\in \mathcal{P}$ denote the event that one of the patches is equal to $P$.
 		In other words
 		\begin{align*}
 		P\in\mathcal{P} := \NZ{\overline{\partial}P} \cap \Z{P}.
 		\end{align*}
-		For $\mathcaP{I}'\subseteq 2^{2^V}$ a set of patches we denote by $\mathcal{P}'\in \mathcal{P}$ the event that $\mathcal{P}'$ is a subset of the patches, i.e.,
+		For $\mathcal{I}'\subseteq 2^{2^V}$ a set of patches we denote by $\mathcal{P}'\in \mathcal{P}$ the event that $\mathcal{P}'$ is a subset of the patches, i.e.,
 		\begin{align*}
 			\mathcal{P}'\in \mathcal{P} := \bigcup_{P\in \mathcal{P}'}\NZ{\overline{\partial}P} \cap \Z{P}.
 		\end{align*}
 	\end{definition}
 	We are often going to use the observation that we can partition the event $\Z{v}$ using patches:

0 comments (0 inline, 0 general)