A Gillespie-Type Algorithm for Particle Based Stochastic Model on Lattice
| dc.contributor.author | Liu, Weigang | en |
| dc.contributor.committeechair | Cao, Yang | en |
| dc.contributor.committeemember | Onufriev, Alexey V. | en |
| dc.contributor.committeemember | Cheng, Shengfeng | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2020-01-16T14:24:34Z | en |
| dc.date.available | 2020-01-16T14:24:34Z | en |
| dc.date.issued | 2019 | en |
| dc.description.abstract | In this thesis, I propose a general stochastic simulation algorithm for particle based lattice model using the concepts of Gillespie's stochastic simulation algorithm, which was originally designed for well-stirred systems. I describe the details about this method and analyze its complexity compared with the StochSim algorithm, another simulation algorithm originally proposed to simulate stochastic lattice model. I compare the performance of both algorithms with application to two different examples: the May-Leonard model and Ziff-Gulari-Barshad model. Comparison between the simulation results from both algorithms has validate our claim that our new proposed algorithm is comparable to the StochSim in simulation accuracy. I also compare the efficiency of both algorithms using the CPU cost of each code and conclude that the new algorithm is as efficient as the StochSim in most test cases, while performing even better for certain specific cases. | en |
| dc.description.abstractgeneral | Computer simulation has been developed for almost one century. Stochastic lattice model, which follows the physics concept of lattice, is defined as a kind of system in which individual entities live on grids and demonstrate certain random behaviors according to certain specific rules. It is mainly studied using computer simulations. The most widely used simulation method to for stochastic lattice systems is the StochSim algorithm, which just randomly pick an entity and then determine its behavior based on a set of specific random rules. Our goal is to develop new simulation methods so that it is more convenient to simulate and analyze stochastic lattice system. In this thesis I propose another type of simulation methods for the stochastic lattice model using totally different concepts and procedures. I developed a simulation package and applied it to two different examples using both methods, and then conducted a series of numerical experiment to compare their performance. I conclude that they are roughly equivalent and our new method performs better than the old one in certain special cases. | en |
| dc.format.medium | ETD | en |
| dc.identifier.uri | http://hdl.handle.net/10919/96455 | en |
| dc.language.iso | en_US | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | Creative Commons Attribution 4.0 International | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en |
| dc.subject | Gillespie algorithm | en |
| dc.subject | stochastic simulation | en |
| dc.subject | lattice model | en |
| dc.title | A Gillespie-Type Algorithm for Particle Based Stochastic Model on Lattice | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Computer Science | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | M.S. | en |