Biomod/2011/Caltech/DeoxyriboNucleicAwesome/Random Walk Formula
From OpenWetWare
(→Random Walk Formula) 
(→Random Walk Formula) 

Line 13:  Line 13:  
==Random Walk Formula==  ==Random Walk Formula==  
  Two assumptions are made in our case. 1)  +  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  +  
  <div class="center" style="width:auto; marginleft:auto; marginright:auto;"><math>h(t;i) = q·h(t1;i1) + r·h(t1;i) + p·h(t1; i + 1)</math></div>  +  Let <math> h(t;i)\!</math> be the probability that the walker reaches 0 for the first time after <math>t\!</math> steps given its starting position being <math>i\!</math>. <math>h(t;i)\!</math> obeys the following difference equation 
+  <div class="center" style="width:auto; marginleft:auto; marginright:auto;"><math>h(t;i) = q·h(t1;i1) + r·h(t1;i) + p·h(t1; i + 1)\!</math></div>  
+  
+  for <math>t = 1,2,3,...\!</math> and <math>i = 1,2,3,...,N1\!</math>. We define <math>h(t;0)= 1\!</math> <math>if\!</math> <math>t = 0\!</math>; <math>h(t;0)= 0\!</math> <math>if\!</math> <math>t > 0\!</math>. Also, <math>h(t;i) = 0\!</math> <math>for\!</math> <math>t < i\!</math>.  
+  
+  When <math>i = N\!</math> we have  
+  <div class="center" style="width:auto; marginleft:auto; marginright:auto;"><math>h(t;N) = αh(t1;N)+ βh(t1; N1) \!</math></div>  
+  
+  The generating function for <math>h(t;i)\!</math> can be expressed as <math>H_i (s) = \sum_{t=1}^∞ h(t;1)s^t</math>, <math> s <1\!</math> (Feller, 1971).  
{{Template:DeoxyriboNucleicAwesomeFooter}}  {{Template:DeoxyriboNucleicAwesomeFooter}} 
Revision as of 09:53, 2 October 2011
Sunday, April 19, 2015

Random Walk Formula
General Modeling IdeaThe 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.
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. Random Walk FormulaTwo 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 be the probability that the walker reaches 0 for the first time after steps given its starting position being . obeys the following difference equation for and . We define ; . Also, . When we have The generating function for can be expressed as , (Feller, 1971).
