Abstract
A random walk algorithm is applied to the problem of the diffusion of a particle in a lossy medium. The formulation used is computationally more efficient than previous algorithms for the particular problem of carrier diffusion in semiconductors; first, because losses are handled with ‘‘fractional’’ carriers that average over many possible walks and, second, because use of a constant length step allows integer arithmetic. The procedure is verified by application to a three-dimensional diffusion problem that may also be solved by the method of images. The improvement appears to be applicable to a range of problems that are handled by random walks.

This publication has 6 references indexed in Scilit: