| Both sides previous revisionPrevious revisionNext revision | Previous revision |
| dev:quiz_ulam [2015/06/22 18:23] – [Boxes Experiments] xychen | dev:quiz_ulam [2015/06/28 17:52] (current) – xychen |
|---|
| The intensive interactions let the ''Pair'' hit the boundary more often. Also the chance of produce more ''Pairs'' is greater. In 11 of the 32 runs, the ''Pair'' hit boundaries. In 4 of the 32 runs, more ''Pairs'' were created. So we have only 17 runs that produced the results we can use. The right graph shows this //Grid// case of the ''Pair'''s interfered walks. In the 17 experiments, the average distance that the ''Pair'' traversed is 48.0 and the standard deviation is 18.8. So we can at least say that the ''Boxes'' grid helped to extend the average mahattan distance that a ''Pair'' can traverse from around 40 to 50 (in 50kAEPS). | The intensive interactions let the ''Pair'' hit the boundary more often. Also the chance of produce more ''Pairs'' is greater. In 11 of the 32 runs, the ''Pair'' hit boundaries. In 4 of the 32 runs, more ''Pairs'' were created. So we have only 17 runs that produced the results we can use. The right graph shows this //Grid// case of the ''Pair'''s interfered walks. In the 17 experiments, the average distance that the ''Pair'' traversed is 48.0 and the standard deviation is 18.8. So we can at least say that the ''Boxes'' grid helped to extend the average mahattan distance that a ''Pair'' can traverse from around 40 to 50 (in 50kAEPS). |
| | |
| {{:dev:4base.png?280 |}} {{:dev:shot_new.png?290|}} {{:dev:grid_new.png?300|}} | {{:dev:2base_500.png?300|}} {{:dev:2shot_600.png?280|}} {{:dev:2grid_400.png?280|}} |
| |
| | The left graph is 526 //Base Case// runs on 2 by 2 simulator after 12 kAEPS. Average distance for //Shot Case// is 18.8. Standard deviation is 9.9. The middle graph is 642 //Shot Case// runs for the same size and time. Average distance for //Shot Case// is 19.2. Standard deviation is 10.2.(This time ''Pairs'' do not seem to favor the 1st quadrant. We see better with more data points.) The right graph is 466 //Grid Case// runs. Average distance for //Grid Case// is 19.4. Standard deviation is 10.0. (This time the three layouts seemed to produce similar end-positions. ) |
| | |
| | {{:dev:4base_500.png?280|}} {{:dev:4shot_600.png?280|}} {{:dev:4grid_500.png?280|}} |
| | |
| | nearly 1/4 data in the ''{2C2}'' experiments are invalid because of they hit the boundary. To rule out the influence of th missing data points(those hit the boundary), we ran the experiments on bigger simulator again. The left graph is 516 //Base Case// runs on ''{4C4}'' simulator after 10 kAEPS. Average distance for //Base Case// is 21.1. Standard deviation is 11.8. The middle graph is 604 //Shot Case// runs on ''{4C4}'' simulator. Average distance for //Shot Case// is 21.8. Standard deviation is 11.9. The right graph is 521 //Grid Case// runs on ''{4C4}''. Average distance for //Grid Case// is 23.1. Standard deviation is 13.0. |
| | |
| | In the bigger simulator and less time length, we had no data hitting the boundary. The ''{4C4}'' average distance we got seems greater than the ''{2C2}'' average distance. However, nearly 1/4 of the ''{2C2}'' data fell out of the edge. So the actual average distance in ''{2C2}'' should be greater than the data shows. In both experiments, we can see the grid helped to extend the range a ''Pair'' traversed. The extension in ''{2C2}'' seems to be less than 5% (from 18.8 to 19.4) because more data points fell out of the edge. In ''{4C4}'' experiments, the average distances are extended nearly by 9% (from 21.1 to 23.1). This shows that the some //pulses// that travel faster than //walks// are produced in the grid. |
| | |
| | The end-positions of the experiments didn't show obvious bias. That's fair because of the initial layout of our experiments. When ''Boxes'' are evenly placed in grid pattern, they //attract// the ''Pairs'' evenly, which will produce no bias. When ''Boxes'' are placed in a line, they are too sparse to //trap// ''Pairs''. This did not produce bias either. In the following experiment, we will place a bunch of ''Boxes'' in the 1st quadrant. This cluster of ''Boxes'' will //attract// the first ''Pair'' and produce more ''Pairs''. Then, the end-positions will show obvious favor to the 1st quadrant. |
| | |
| | {{:dev:4overlay_500.png?350|}} |
| | |
| | The above graph is what we saw if we put the three pictures together. If the end-positions of ''Pairs'' are not surprising, how about the ''Boxes''? Did they still remain in line or in grid? How they were messed up by the ''Pair''? |
| | |
| | |
| Excluding runs that hit the boundary messes up the data. Should use a bigger grid, so that hitting the boundary is very rare. It will run slower but just use more machines. And we don't care if more pairs are created, right? We just wanted the distance to the farthest pair. | Excluding runs that hit the boundary messes up the data. Should use a bigger grid, so that hitting the boundary is very rare. It will run slower but just use more machines. And we don't care if more pairs are created, right? We just wanted the distance to the farthest pair. |
| |
