diff --git a/docs/source/algorithm.md b/docs/source/algorithm.md index f6854b1..d68b31e 100644 --- a/docs/source/algorithm.md +++ b/docs/source/algorithm.md @@ -55,7 +55,7 @@ Each voxel inside the mask gets one of four roles, chosen as pyAFQ's tracker cho | white matter | WM PVE > 0.4 | **transient**: walkers move here | | grey matter | otherwise, where GM PVE ≥ CSF PVE | **absorbing**, a valid end | | CSF | otherwise | **blocked**: never entered; a hop into CSF has probability 0 | -| edge | the mask's inner boundary | **absorbing**, a valid end (fibres leaving the field of view) | +| edge | the mask's inner boundary | **absorbing**, a valid end (fibres leaving the field of view; for example, in the corticospinal tract) | A walker on its way through white matter remembers which way it is going. A state of the chain is therefore a pair @@ -156,7 +156,7 @@ scatter $Q^\top x$, and backward steps gather $Qx$ (`mpat.chain.Chain`). Order the states as white-matter (transient) states and absorbing voxels. One step of the chain is $$ -\begin{pmatrix} Q & R \\ 0 & I \end{pmatrix}, +\begin{pmatrix} I & 0 \\ Q & R \end{pmatrix}, $$ with $Q$ the transient-to-transient block and $R$ the transient-to-absorbing block. Each row of $[\,Q\;R\,]$ plus the row's death probability sums to 1. Mass $x$ spread over the