Biomod/2011/Caltech/DeoxyriboNucleicAwesome/Simulation: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
{{Template:DeoxyriboNucleicAwesomeHeader}} | {{Template:DeoxyriboNucleicAwesomeHeader}} | ||
=Simulations= | |||
__TOC__ | |||
==Simulation of Expected Results== | ==Simulation of Expected Results== | ||
Our proposed sorting mechanism depends very heavily on a particular random-walking mechanism that has not been demonstrated in literature before. The verification of this mechanism is thus a vital step in our research. Verification of the random walk in one dimension is fairly straightforward: as discussed in <LINK TO THE EXPERIMENTAL DESIGN SECTION>, a one-dimensional track is easy to construct, and will behave like a [http://en.wikipedia.org/wiki/Random_walk#One-dimensional_random_walk standard 1D random walk], showing an average translation on the order of <math>n^{\frac{1}{2}}</math> after n steps. Thus, we should expect the time it takes to get to some specific level of fluorescence to be proportional to the square of the number of steps we start the walker from the irreversible substrate. If we can, in an experiment, record the fluorescence over time when the walker is planted at different starting points and show that that fluorescence varies by this relationship, we'll have fairly certainly verified one-dimensional random walking. | Our proposed sorting mechanism depends very heavily on a particular random-walking mechanism that has not been demonstrated in literature before. The verification of this mechanism is thus a vital step in our research. Verification of the random walk in one dimension is fairly straightforward: as discussed in <LINK TO THE EXPERIMENTAL DESIGN SECTION>, a one-dimensional track is easy to construct, and will behave like a [http://en.wikipedia.org/wiki/Random_walk#One-dimensional_random_walk standard 1D random walk], showing an average translation on the order of <math>n^{\frac{1}{2}}</math> after n steps. Thus, we should expect the time it takes to get to some specific level of fluorescence to be proportional to the square of the number of steps we start the walker from the irreversible substrate. If we can, in an experiment, record the fluorescence over time when the walker is planted at different starting points and show that that fluorescence varies by this relationship, we'll have fairly certainly verified one-dimensional random walking. | ||
Revision as of 10:12, 22 June 2011
|
Saturday, April 20, 2024
|
SimulationsSimulation of Expected ResultsOur proposed sorting mechanism depends very heavily on a particular random-walking mechanism that has not been demonstrated in literature before. The verification of this mechanism is thus a vital step in our research. Verification of the random walk in one dimension is fairly straightforward: as discussed in <LINK TO THE EXPERIMENTAL DESIGN SECTION>, a one-dimensional track is easy to construct, and will behave like a standard 1D random walk, showing an average translation on the order of [math]\displaystyle{ n^{\frac{1}{2}} }[/math] after n steps. Thus, we should expect the time it takes to get to some specific level of fluorescence to be proportional to the square of the number of steps we start the walker from the irreversible substrate. If we can, in an experiment, record the fluorescence over time when the walker is planted at different starting points and show that that fluorescence varies by this relationship, we'll have fairly certainly verified one-dimensional random walking. Our particular case of 2D random walking, however, is not as easily understood, especially considering the mobility restrictions (i.e. its ability to move to only 4 of 6 surrounding locations at any particular time) of our particular walker. As a control for the verification of 2D random walking, though, we still need to get an idea how long the random walk should take, and how that time will change as we start the walker at different points on the origami. We opt to do this by simulating the system with a set of movement rules derived from our design. We also use the same basic simulation (with a few alterations and extra features) to simulate our entire sorting system in a one-cargo, one-goal scenario, to give us some rudimentary numbers on how long sorting should take, with one vs multiple walkers.
|
