期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2015
卷号：5
期号：2
页码：109-112
出版社：International Journal of Soft Computing & Engineering
摘要：A novel scheme has been studied and demonstrated for Monte Carlo simulations of diffusion-reaction processes. The new algorithm skips the traditional small diffusion hops and propagates the diffusing particles over long distances through a sequence of super-hops, one particle at a time. By partitioning the simulation space into non- overlapping protecting domains each containing only one or two particles, the algorithm factorizes the N-body problem of collisions among multiple Brownian particles into a set of much simpler single-body and two-body problems. Efficient propagation of particles inside their protective do- mains is enabled through the use of time-dependent Green's functions (propagators) obtained as solutions for the first-passage statistics of random walks. The resulting Monte Carlo algorithm is event-driven and asynchronous; each Brownian particle propagates inside its own protective domain and on its own time clock. The algorithm reproduces the statistics of the underlying Monte-Carlo model exactly. The new algorithm is efficient at low particle densities, where other existing algorithms slow down severely. Thus we have analyzed the application of this algorithm in the charge distribution and the capacitance detection
关键词：Monte Carlo Simulation; Charge distribution;capacitance; Markov chain
