Simulation of Stochastic Processes with Generation and Transport of Particles

  • Ekaterina Ermishkina
  • Elena Yarovaya
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 231)


In modeling of a cell population evolution, the key characteristics are the existence of several sources where cells can proliferate their copies or die, and migration of cells over an environment. One of the study aims is to obtain the threshold value of a parameter which separates different types of the cell proliferation process at the sources. Continuous-time branching random walks on multidimensional lattices with a few sources of branching can be used for modeling of a cell population dynamics. For example, active growth of the cancer cellular population in the frame of branching random walk models may be explained by the excess of the threshold value. Branching random walks is an appropriate tool to describe such processes in terms of generation and transport of particles. The effect of phase transitions on the asymptotic behavior of a particle population in the frame of branching random walks was studied analytically in detail by many authors. Simulation of branching random walks is applied for numerical estimation of a threshold value of the parameter on limited time intervals. Obtained results are used to define strategies that may delay a cell population progression to some extent. The work may be treated as the first step to the simulation of branching random walks. We assume that the process started by the initial particle which walks on the lattice until it reaches one of the sources where its behavior changes, and new copies may appear. All particles behave independently of each other and of their history. We present an approach to simulation of the mean number of particles over the lattice and in every point of the lattice. Simulation of the process is based on a well-known algorithm of queue data structures and the Monte Carlo method.


Branching processes Random walks Branching random walks Simulation The Monte Carlo method 



This study was performed at Lomonosov Moscow State University and at Steklov Mathematical Institute of Russian Academy of Sciences. The work was supported by the Russian Science Foundation, project no. 14-21-00162.


  1. 1.
    Albeverio, S., Bogachev, L.V., Yarovaya, E.B.: Asymptotics of branching symmetric random walk on the lattice with a single source. C. R. Acad. Sci. Paris Sér. I Math. 326(8), 975–980 (1998). Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)zbMATHGoogle Scholar
  3. 3.
    Daletski, Y.L., Krein, M.G.: Ustoichivost reshenii differentsialnykh uravnenii v banakhovom prostranstve. Izdat. Nonlinear Analysis and its Applications Series. “Nauka”, Moscow (1970) (in Russian)Google Scholar
  4. 4.
    Fedotov, S., Iomin, A.: Probabilistic approach to a proliferation and migration dichotomy in tumor cell invasion. Phys. Rev. E 77(3), 031,911, 10 (2008).
  5. 5.
    Fishman, G.S.: Monte Carlo: Concepts, Algorithms, and Applications. Springer Series in Operations Research. Springer, New York (1996)Google Scholar
  6. 6.
    Molchanov, S.A., Yarovaya, E.B.: The population structure inside the propagation front of a branching random walk with a finite number of particle generation centers. Dokl. Akad. Nauk 447(3), 265–268 (2012).
  7. 7.
    Thalhauser, C.J., Lowengrub, J.S., Stupack, D., Komarova, N.L.: Selection in spatial stochastic models of cancer: migration as a key modulator of fitness. Biol. Direct 5(21), 1–17 (2010). Scholar
  8. 8.
    Vatutin, V.A., Topchiĭ, V.A., Yarovaya, E.B.: Catalytic branching random walks and queueing systems with a random number of independent servers. Theory Probab. Math. Stat. 69, 1–15 (2003)Google Scholar
  9. 9.
    Yarovaya, E.B.: Branching random walks in a heterogeneous environment. Center of Applied Investigations of the Faculty of Mechanics and Mathematics of the Moscow State University, Moscow (2007) (In Russian)Google Scholar
  10. 10.
    Yarovaya, E.B.: Criteria for the exponential growth of the number of particles in models of branching random walks. Teor. Veroyatn. Primen. 55(4), 705–731 (2010).
  11. 11.
    Yarovaya, E.B.: Spectral properties of evolutionary operators in branching random walk models. Math. Notes 92(1), 115–131 (2012)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Yarovaya, E.B.: Branching random walks with several sources. Math. Popul. Stud. 20(1), 14–26 (2013)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Yarovaya, E.B.: The structure of the positive discrete spectrum of the evolution operator arising in branching random walks. Dokl. Math. 92(1), 507–510 (2015). Scholar
  14. 14.
    Yarovaya, E.: Positive discrete spectrum of the evolutionary operator of supercritical branching walks with heavy tails. Methodol. Comput. Appl. Probab. 1–17 (2016).

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Probability TheoryLomonosov Moscow State UniversityMoscowRussia

Personalised recommendations