Rosenbluth Algorithm Studies of Self-Avoiding Walks
| dc.contributor.advisor | VanRensburg, Esaias J. Janse | |
| dc.creator | Tabrizi, Mandana | |
| dc.date.accessioned | 2015-12-16T19:30:22Z | |
| dc.date.available | 2015-12-16T19:30:22Z | |
| dc.date.copyright | 2015-08-07 | |
| dc.date.issued | 2015-12-16 | |
| dc.date.updated | 2015-12-16T19:30:22Z | |
| dc.degree.discipline | Applied and Industrial Mathematics | |
| dc.degree.level | Master's | |
| dc.degree.name | MSc - Master of Science | |
| dc.description.abstract | In this thesis we used self-avoiding walks as a model of linear polymers to study some of the most fundamental questions about polymers- namely the quantification of polymer entropy. We introduced scaling formulas for the number of walks and other polymer properties such as radius of gyration and end-to-end distance. Then, we calculated these quantities using a Monte Carlo simulation and estimated the critical exponents in the scaling formulas. There is a pressure field in the vicinity of a polymer and a particle placed close to the polymer will accelerate away from it due to the pressure gradient. The scaling of the pressure as a function of distance from the polymer and length of the polymer is determined and tested numerically. Also, we modeled the relationship between velocity and the position of the particle in the 2-dimensional lattice and estimated the limiting speed. | |
| dc.identifier.uri | http://hdl.handle.net/10315/30743 | |
| dc.language.iso | en | |
| dc.rights | Author owns copyright, except where explicitly noted. Please contact the author directly with licensing requests. | |
| dc.subject | Mathematics | |
| dc.subject.keywords | Rosenbluth algorithm | |
| dc.subject.keywords | self-avoiding random walks | |
| dc.title | Rosenbluth Algorithm Studies of Self-Avoiding Walks | |
| dc.type | Electronic Thesis or Dissertation |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Tabrizi_Mandana_2015_Masters.pdf
- Size:
- 877.17 KB
- Format:
- Adobe Portable Document Format