Binning for efficient stochastic particle simulations

stochastic;Markov process;coalescence;atmospheric aerosol;stochastic simulation algorithm;tau leaping;particle resolved

Michelotti, Matthew ; Heath ; Michael T. ; West ; Matthew

关键词: stochastic;    Markov process;    coalescence;    atmospheric aerosol;    stochastic simulation algorithm;    tau leaping;    particle resolved;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/42127/Matthew_Michelotti.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Gillespie's Stochastic Simulation Algorithm (SSA) is an exact procedure for simulating the evolution of a collection of discrete, interacting entities, such as coalescing aerosol particles or reacting chemical species.The high computational cost of SSA has motivated the development of more efficient variants, such as Tau-Leaping, which sacrifices the exactness of SSA.For models whose interacting entities can be characterized by a continuous parameter, such as a measure of size for aerosol particles, we analyze strategies for accelerating these algorithms by aggregating particles of similar size into bins.We show that for such models an appropriate binning strategy can dramatically enhance efficiency, and in particular can make SSA computationally competitive without sacrificing exactness.We formulate binned versions of both the SSA and Tau-Leaping algorithms and analyze and demonstrate their performance.