Biomod/2011/Caltech/DeoxyriboNucleicAwesome/Random Walk Formula

From OpenWetWare

(Difference between revisions)
Jump to: navigation, search
(Parameter Estimation)
(Random Walk Formula)
Line 12: Line 12:
[[Image:RW.bmp|thumb|center|800px|Figure 2. A line segment with N+1 distinct sites. The walker starts the random walk at i and is reflected at N with a probability of β. The random walk ends once it reaches site 0.  ]]
[[Image:RW.bmp|thumb|center|800px|Figure 2. A line segment with N+1 distinct sites. The walker starts the random walk at i and is reflected at N with a probability of β. The random walk ends once it reaches site 0.  ]]
-
==Random Walk Formula==
+
==General Formula==
Two assumptions are made in our case. 1) The DNA origami is immune to any free floating walkers in solution, meaning that free floating walkers cannot bind to an origami and starts random walking; 2) walkers are immediately absorbed when reaching the rectangles with WGs, despite the presence of two TR2 in the same rectangle.  
Two assumptions are made in our case. 1) The DNA origami is immune to any free floating walkers in solution, meaning that free floating walkers cannot bind to an origami and starts random walking; 2) walkers are immediately absorbed when reaching the rectangles with WGs, despite the presence of two TR2 in the same rectangle.  

Revision as of 05:40, 3 October 2011

Image:DeoxyriboNucleicAwesomeHeader.jpg

Friday, December 19, 2014

Home

Members

Project

Protocols

Progress

Discussion

References


Random Walk Formula

Contents

General Modeling Idea

The random walk on DNA origami can be modeled as one dimensional random walk with a reflecting and an absorbing barrier (Figure 1). Tracks in the same column are grouped into rectangles, and each step is defined as walking from one rectangle to an adjacent one.


Figure 1. Modeling the random walk on DNA origami as one dimensional random walk. Cyan, markers. Blue, Track 1. Red, Track 2. White, DNA staples only. Five-pointed star, walker goal. Each step is modeled as walking from one rectangle to an adjacent one. SP 10, 22, 34 indicate different starting positions. Note that in the cases of SP22 and SP34, there are no tracks to the left of starting positions.
Figure 1. Modeling the random walk on DNA origami as one dimensional random walk. Cyan, markers. Blue, Track 1. Red, Track 2. White, DNA staples only. Five-pointed star, walker goal. Each step is modeled as walking from one rectangle to an adjacent one. SP 10, 22, 34 indicate different starting positions. Note that in the cases of SP22 and SP34, there are no tracks to the left of starting positions.

Consider a random walk on a line segment with N+1 sites denoted by integers (0,1,2, … , N) (Figure 2). The walker starts random walk at site i, 0 < i ≤ N. Let p be the probability for the walker to move one segment to the left, q be the probability for the walker to move one segment to the right. The probability for the walker to stay at a particular site for the next unit time is thus r = 1 – p – q. When the walker reaches site N, the partially reflecting barrier, it has a probability of β to be reflected back to site N – 1, and a probability of α = 1 – β to stay at site N in the next unit time. When reaching site 0, the absorbing barrier, it stays there for 100% probability and the random walk ends.

Figure 2. A line segment with N+1 distinct sites. The walker starts the random walk at i and is reflected at N with a probability of β. The random walk ends once it reaches site 0.
Figure 2. A line segment with N+1 distinct sites. The walker starts the random walk at i and is reflected at N with a probability of β. The random walk ends once it reaches site 0.

General Formula

Two assumptions are made in our case. 1) The DNA origami is immune to any free floating walkers in solution, meaning that free floating walkers cannot bind to an origami and starts random walking; 2) walkers are immediately absorbed when reaching the rectangles with WGs, despite the presence of two TR2 in the same rectangle.

Let  h(t;i)\! be the probability that the walker reaches 0 for the first time after t\! steps given its starting position being i\!. h(t;i)\! obeys the following difference equation

h(t;i) = q·h(t-1;i-1) + r·h(t-1;i) + p·h(t-1; i + 1)\!

for t  = 1,2,3,...\! and i = 1,2,3,...,N-1\!. We define h(t;0)= 1\! if\! t = 0\!; h(t;0)= 0\! if\! t > 0\!. Also, h(t;i) = 0\! for\! t < i\!.

When i = N\! we have

h(t;N) = αh(t-1;N)+ βh(t-1; N-1) \!

The generating function for h(t;i)\! can be expressed as

H_i (s) = \sum_{t=0}^\infty h(t;1)s^t,|s| <1 \!

Following Netus (1963), the explicit expression of the generating function is

H_i (s) =\begin{cases} \frac {q^i s^i T_i (s)} {T_0 (s)}, 0\leqslant i < N\\
 \frac {\beta q^{N-1} s^N (\lambda_1 - \lambda_2)} {T_0 (s)},i=N\end{cases}\!

where

T_i (s) = (1-\alpha s)(\lambda_1 ^{N-i}-\lambda_2 ^{N-i})-\beta p s^2 (\lambda_1 ^{N-i-1}-\lambda_2 ^{N-i-1})\!

and

\lambda_{1,2} = \frac {1} {2} ( \pm \sqrt{{(1-rs)}^2-4 p q s^2} +1-rs ).\!

The explicit expression of h(t;i)\! can thus be deduced from H_i (s)\! using partial fraction expansion (Feller, 1971).

Assume that T_0 (s)\! has k\! distinct roots s_1,s_2,..., s_k . H_i (s)\! can then be decomposed into partial fractions

 H_i (s) = \frac {\rho_1} {s-s_1} + \frac{\rho_2}{s-s_2} +...+ \frac {\rho_k}{s-s_k} \!

where

 \rho_k = \frac {-q^i {s_m}^i T_i (S_m)}{{T_0}^' (s_m)}, m\leqslant k \!

It follows that

h(t;i) = \sum_{m=1}^k \frac {\rho_m}{{s_m}^{t+1}} \!

h(t;N)\! can be similarly deduced from H_N (s)\! using the same method.

Parameter Estimation

Possible positions of walkers on the origami can be grouped into two categories, either in the center of rectangles (Figure 2, Line 2) or at the sides (Figure 2, Lines 1&3), and the values of p\!, q\! and r\! are different in each category. Hence there is a need to find out the distribution of walkers in these two categories in order to estimate p\!, q\! and r\!. Due to the nature of our design, each walker has a probability of 50% to stay at its original track after one branch migration. Assuming no reflecting boundaries, when the walker is in the center (Figure 2, Line 2), the probability of staying in Line 2 after one branch migration is \frac {1}{2}+\frac{1}{2} \times \frac{1}{2}=\frac{3}{4}, while the probability of going to Lines 1 or 3 is 1- \frac{3}{4}=\frac{1}{4}. Similarly, when it is in Lines 1 or 3, the probability of staying in the same line after one branch migration is \frac{1}{2}+\frac{1}{2} \times \frac{2}{3}=\frac{5}{6} while the probability of going to Line 2 is 1- \frac{5}{6}=\frac{1}{6}. Here we assume no reflecting barrier in the system. The distribution of relative positions of walkers can be modeled using Markov chain as follows.

Let v(t) = (a, 1–a)\! denote the proportion of walkers in Line 2 (a)\! and Lines 1&3 (1–a)\! after t\! branch migrations. Since all the walkers are initially planted in the center, v(0) = (1, 0)\!. Define the transition matrix

 M = \begin{pmatrix}
 \frac{3}{4} & \frac{1}{4} \\
 \frac{1}{6} & \frac{5}{6}
\end{pmatrix}. \!

It follows that

 v(t)=v(0). \underbrace{M.M.M...M}_{t} \!

References

  • Ahmed El-Shehawy (1992). On absorption probabilities for a random walk between two different barriers. Annals De La Faculte Des Sciences De Toulouse, 1(1), 95-103.
  • Feller, W. (1971). An introduction to probability theory and its applications.
  • Netus, M. (1963). Absorption probabilities for a random walk between a reflecting and an absorbing barrier. Bull. Soc. Math. Belgique, 15, 253-258.
Personal tools