Random walks with ‘spontaneous emission’ on lattices with periodically distributed imperfect traps

We study random walks on d-dimensional lattices with periodically distributed traps in which the walker has a finite probability per step of disappearing from the lattice and a finite probability of escaping from a trap. General expressions are derived for the total probability that the walk ends in a trap and for the moments of the number of steps made before this happens if it does happen. The analysis is extended to lattices with more types of traps and to a model where the trapping occurs during special steps. Finally, the Green's function at the origin G(0; z) for a finite lattice with periodic boundary conditions, which enters into the main expressions, is studied more closely. A generalization of an expression for G(0; 1) for the square lattice given by Montroll to values of z different from, but close to, 1 is derived.     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

An exponential upper bound for the survival probability in a dynamic random trap model

We consider a symmetric translation-invariant random walk on thed-dimensional lattice ? ^d . The walker moves in an environment of moving traps. When the walker hits a trap, he is killed. The configuration of traps in the course of time is a reversible Markov process satisfying a level-2 large-deviation principle. Under some restrictions on the entropy function, we prove an exponential upper bound for the survival probability, i.e., $$\mathop {lim sup}\limits_{t \to \infty } \frac{1}{t}\log \mathbb{P}(T \geqslant t)< 0$$ whereT is the survival time of the walker. As an example, our results apply to a random walk in an environment of traps that perform a simple symmetric exclusion process.     

Random walks on lattices with a random distribution of perfect traps

We made an accurate numerical determination of the average number of steps until trapping n of a particle performing a random walk on a square resp. cubic lattice containing traps. We assume a random distribution of perfect trap centers with densityq. Within a large range ofq-values we observe aq-dependence of the form n=–q ^– lnq with 0.817, resp. 0.689. The expression coincides with expansion results aroundq=1 and is compatible with expansion results aroundq=0.     

Thymic Selection of T Cells as Diffusion with Intermittent Traps

T cells orchestrate adaptive immune responses by recognizing short peptides derived from pathogens, and by distinguishing them from self-peptides. To ensure the latter, immature T cells (thymocytes) diffuse within the thymus gland, where they encounter an ensemble of self-peptides presented on (immobile) antigen presenting cells. Potentially autoimmune T cells are eliminated if the thymocyte binds sufficiently strongly with any such antigen presenting cell. We model thymic selection of T cells as a random walker diffusing in a field of immobile traps that intermittently turn “on” and “off”. The escape probability of potentially autoimmune T cells is equivalent to the survival probability of such a random walker. In this paper we describe the survival probability of a random walker on a d-dimensional cubic lattice with randomly placed immobile intermittent traps, and relate it to the result of a well-studied problem where traps are always “on”. Additionally, when switching between the trap states is slow, we find a peculiar caging effect for the survival probability.     

Long-time asymptotics in the one-dimensional trapping problem with large bias

The survival probability of a particle which moves according to a biased random walk in a one-dimensional lattice containing randomly distributed deep traps is studied at large times. Exact asymptotic expansions are deduced for fields exceeding a certain threshold, using the method of images. In order to cover the whole range of fields, we also derive the behavior of the survival probability below this threshold, using the eigenvalue expansion method. The connection with the continuous diffusion model is discussed.     

Stochastic flows,reaction — Diffusion processes,and morphogenesis

Recently, anexact procedure has been introduced [C. A. Walsh and J. J. Kozak,Phys. Rev. Lett. 47:1500 (1981)] for calculating the expected walk length 〈n〉 for a walker undergoing random displacements on a finite or infinite (periodic)d-dimensional lattice with traps (reactive sites). The method (which is based on a classification of the symmetry of the sites surrounding the central deep trap and a coding of the fate of the random walker as it encounters a site of given symmetry) is applied here to several problems in lattice statistics for each of whichexact results are presented. First, we assess the importance of lattice geometry in influencing the efficiency of reaction-diffusion processes in simple and multiple trap systems by reporting values of 〈n〉 for square (cubic) versus hexagonal lattices ind=2, 3. We then show how the method may be applied to variable-step (distance-dependent) walks for a single walker on a given lattice and also demonstrate the calculation of the expected walk length 〈n〉 for the case of multiple walkers. Finally, we make contact with recent discussions of “mixing” by showing that the degree of chaos associated with flows in certain lattice systems can be calibrated by monitoring the lattice walks induced by the Poincaré map of a certain parabolic function.     

Comment on a paper by G. H. Weiss,S. Havlin,and A. Bunde

A simple proof is pointed out for the asymptotic exponential decay of then-step survival probability of a random walk on a finite lattice with traps in the limit asn . Some bounds are mentioned, which are valid for finiten and for symmetric random walks.     

Fractal behavior in trapping and reaction: A random walk study

We investigate the trapping of a random walker in fractal structures (Sierpinski gaskets) with randomly distributed traps. The survival probability is determined from the number of distinct sites visited in the trap-free fractals. We show that the short-time behavior and the long-time tails of the survival probability are governed by the spectral dimensiond. We interpolate between these two limits by introducing a scaling law. An extension of the theory, which includes a continuous-time random walk on fractals, is discussed as well as the case of direct trapping. The latter case is shown to be governed by the fractal dimensiond.     

具有无规分布陷阱点阵上的连续时间无规行走

用连续时间无规行走(CTRW)理论处理陷阱控制的无序点阵上的无规行走问题,首次导出行走者可有自发衰变及受陷态具有有限寿命情形下,行走者存活几率P(t)满足的方程。对一种广泛使用的等待时间分布密度ψ(t)=ααt^-(1-α)exp(-αt^α)0<α≤1,在受陷态寿命无限长情况下,给出适用于任意陷阱浓度和任意时间的P(t)的级数解。结合实验事实和Ngai的低能激发理论,指出同时考虑动力学关联和结构无序对解释实际过程的必要性。并提出包括可由Ngai低能激发理论描写的动力学关联在内的连续时间无规行走理论,其物理图象与目前的CTRW理论有根本不同。 关键词：     

Survival of Classical and Quantum Particles in the Presence of Traps

We present a detailed comparison of the motion of a classical and of a quantum particle in the presence of trapping sites, within the framework of continuous-time classical and quantum random walk. The main emphasis is on the qualitative differences in the temporal behavior of the survival probabilities of both kinds of particles. As a general rule, static traps are far less efficient to absorb quantum particles than classical ones. Several lattice geometries are successively considered: an infinite chain with a single trap, a finite ring with a single trap, a finite ring with several traps, and an infinite chain and a higher-dimensional lattice with a random distribution of traps with a given density. For the latter disordered systems, the classical and the quantum survival probabilities obey a stretched exponential asymptotic decay, albeit with different exponents. These results confirm earlier predictions, and the corresponding amplitudes are evaluated. In the one-dimensional geometry of the infinite chain, we obtain a full analytical prediction for the amplitude of the quantum problem, including its dependence on the trap density and strength.     

Random walks in a random field of decaying traps

We study random walks on ^d (d 1) containing traps subject to decay. The initial trap distribution is random. In the course of time, traps decay independently according to a given lifetime distribution. We derive a necessary and sufficient condition under which the walk eventually gets trapped with probability 1. We prove bounds and asymptotic estimates for the survival probability as a function of time and for the average trapping time. These are compared with some well-known results for nondecaying traps.     

Random walks with short memory

A restricted random walk on ad-dimensional cubic lattice with different probabilities for forward, backward, and sideward steps is studied. The analytic solution for the generating function, exact expressions for the second and fourth moments of displacements, and diffusion and Burnett coefficients are given, as well as a systematic asymptotic expansion for the probability distribution of long walks.This paper is dedicated to Nico van Kampen.     

Multiple trapping of random walkers on periodic lattices

Formulas are obtained for the mean absorption time of a set ofk independent random walkers on periodic space lattices containingq traps. We consider both discrete (here we assume simultaneous stepping) and continuous-time random walks, and find that the mean lifetime of the set of walkers can be obtained, via a convolution-type recursion formula, from the generating function for one walker on the perfect lattice. An analytical solution is given for symmetric walks with nearest neighbor transitions onN-site rings containing one trap (orq equally spaced traps), for both discrete and exponential distribution of stepping times. It is shown that, asN , the lifetime of the walkers is of the form Ta_kN², whereT is the average time between steps. Values ofa _k, 2 Sk 6, are provided.     

Random walks on inhomogeneous lattices

For lattices with two kinds of points (black and white), distributed according to a translation-invariant joint probability distribution, we study statistical properties of the sequence of consecutive colors encountered by a random walker moving through the lattice. The probability distribution for the single steps of the walk is considered to be independent of the colors of the points. Several exact results are presented which are valid in any number of dimensions and for arbitrary probability distributions for the coloring of the points and the steps of the walk. They are used to derive a few general properties of random walks on lattices containing traps.Presented at the Symposium on Random Walks, Gaithersburg, MD, June 1982.     

Random walks on the Bethe lattice

We obtain random walk statistics for a nearest-neighbor (Pólya) walk on a Bethe lattice (infinite Cayley tree) of coordination numberz, and show how a random walk problem for a particular inhomogeneous Bethe lattice may be solved exactly. We question the common assertion that the Bethe lattice is an infinite-dimensional system.Supported in part by the U.S. Department of Energy.     

A Limit Result for a System of Particles in Random Environment

We consider an infinite system of particles in one dimension, each particle performs independent Sinai’s random walk in random environment. Considering an instant t, large enough, we prove a result in probability showing that the particles are trapped in the neighborhood of well defined points of the lattice depending on the random environment, t and the starting points of the particles. Supported by GREFI-MEFI and Departimento di Mathematica, Universita di Roma II “Tor Vergata”, Italy.     

Random walks with imperfect trapping in the decoupled-ring approximation

We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical simulations reveal this solution, which is exact in the limit of perfect traps, to be remarkably robust with respect to a significant lowering of the trapping probability. We demonstrate that for randomly distributed traps, the long-time asymptotics of our result recovers the known stretched exponential decay. We also study an anisotropic three-dimensional version of our model. We discuss possible applications of some of our findings to the decay of excitons in semiconducting organic polymer materials, and emphasize the crucial influence of the spatial trap distribution on the kinetics. Received 23 July 2001 / Received in final form 14 May 2002 Published online 13 August 2002     

Random walks on sparsely periodic and random lattices: I. Random walk properties from lattice bond enumeration

We have developed a new technique for calculating certain asymptotic random walk properties on sparsely periodic and related random lattices in two and three dimensions. This technique is based on an ansatz which relates the number of lattice bonds in “irreducible lattice fragments” to the number of steps along these bonds. We show that certain random walk properties can be calculated very simply on the basis of this ansatz and that they depend only on the density of bonds and not on the arrangement of the bonds within the lattice. The random walk properties calculated here (mean square displacements, number of distinct sites visited, probability of return to the origin) are in complete agreement with results obtained earlier via generating function techniques. A subsequent paper contains generating function calculations which verify a number of new results presented here, such as mean occupation frequency of lattice sites, and a proof of our basic assumption on the relation between the number of lattice bonds and random walk steps.     

Random walk in distorted crystal structure

The problem of random walk of particles over the lattice points of a crystal is considered. The concepts of characteristic times of jumps are used in writing and finding the exact solution for a time-dependent equation of migration in a one-dimensional structure with an anisotropic probability of jumps and in the presence of concentrated traps. The case of some characteristic values of the particle capture efficiency of the trap is considered. Differences are revealed between the results of microscopic analysis and the corresponding results of macroscopic theories and the character of the approximation to the deductions of these theories are shown. Some results are also found for steady-state migration and for a three-dimensional structure.Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 2, pp. 121–125, February, 1978.