Random walks on finite lattices with multiple traps: Application to particle-cluster aggregation
For random walks on finite lattices with multiple (completely adsorbing) traps, one is interested in the mean walk length until trapping and in the probability of capture for the various traps (either for a walk with a specific starting site, or for an average over all nontrap sites). We develop the formulation of Montroll to enable determination of the large-lattice-size asymptotic behavior of these quantities. (Only the case of a single trap has been analyzed in detail previously.) Explicit results are given for the case of symmetric nearest-neighbor random walks on two-dimensional (2D) square and triangular lattices. Procedures for exact calculation of walk lengths on a finite lattice with a single trap are extended to the multiple-trap case to determine all the above quantities. We examine convergence to asymptotic behavior as the lattice size increases. Connection with Witten-Sander irreversible particle-cluster aggregation is made by noting that this process corresponds to designating all sites adjacent to the cluster as traps. Thus capture probabilities for different traps determine the proportions of the various shaped clusters formed. (Reciprocals of) associated average walk lengths relate to rates for various irreversible aggregation processes involving a gas of walkers and clusters. Results are also presented for some of these quantities.
- Research Organization:
- Ames Laboratory and Department of Chemistry, Iowa State University, Ames, Iowa 50011
- DOE Contract Number:
- W-7405-ENG-82
- OSTI ID:
- 5005026
- Journal Information:
- Phys. Rev. A; (United States), Vol. 32:5
- Country of Publication:
- United States
- Language:
- English
Similar Records
Random walks on finite lattices with traps
Exact algorithm for d-dimensional walks on finite and infinite lattices with traps. II. General formulation and application to diffusion-controlled reactions