Skip to Main Content
 

Global Search Box

 
 
 
 

Files

ETD Abstract Container

Abstract Header

Computer Simulations of Novel Annihilating Random Walk Problems

Abstract Details

2022, Master of Science, Ohio State University, Statistics.
This paper provides a brief overview of some of the existing literature concerning annihilating random walks and provides a toy example for the reader. Two novel annihilating random walk models are additionally considered. The first examines the case where a + b → ∅. The second examines a case where there is both annihilating and coalescence between a and b particles, where a + a → a, and a + b → ∅. For both problems, computational results from simulations are provided, with keen interest on the decay of a particles. Possibilities for future research are also examined.
David Sivakoff (Advisor)
Radu Herbei (Committee Member)
Mario Peruggia (Committee Member)
35 p.

Recommended Citations

Citations

  • Brune, R. T. (2022). Computer Simulations of Novel Annihilating Random Walk Problems [Master's thesis, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1658509396297228

    APA Style (7th edition)

  • Brune, Ryan. Computer Simulations of Novel Annihilating Random Walk Problems. 2022. Ohio State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1658509396297228.

    MLA Style (8th edition)

  • Brune, Ryan. "Computer Simulations of Novel Annihilating Random Walk Problems." Master's thesis, Ohio State University, 2022. http://rave.ohiolink.edu/etdc/view?acc_num=osu1658509396297228

    Chicago Manual of Style (17th edition)