相关论文: Multiparticle trapping problem in the half-line
When a large number N of independent diffusing particles are placed upon a site of a d-dimensional Euclidean lattice randomly occupied by a concentration c of traps, what is the m-th moment <t^m_{j,N}> of the time t_{j,N} elapsed until the…
The distribution of times $t_{j,N}$ elapsed until the first $j$ independent random walkers from a set of $N \gg 1$, all starting from the same site, are trapped by a quenched configuration of traps randomly placed on a disordered lattice is…
We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
The random walk problem is studied in two and three dimensions in the presence of a random distribution of static traps. An efficient Monte Carlo method, based on a mapping onto a polymer model, is used to measure the survival probability…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
The dynamics of the survival probability of quantum walkers on a one-dimensional lattice with random distribution of absorbing immobile traps are investigated. The survival probability of quantum walkers is compared with that of classical…
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…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
In this work the diffusion in the quenched trap model with diverging mean waiting times is examined. The approach of randomly stopped time is extensively applied in order to obtain asymptotically exact representation of the disorder…
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
We study the survival probability of an immobile target in presence of N independent diffusing walkers. We address the problem of the Mean Target Lifetime and its dependence on the number and initial distribution of the walkers when the…
A discrete implementation on a lattice of the Active Walker Model is presented. After the model's validity is shown in simple simulations, more complex simulations of walkers passing consecutively a lattice from an arbitrary starting point…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We consider a random walker whose motion is tethered around a focal point. We use two models that exhibit the same spatial dependence in the steady state but widely different dynamics. In one case, the walker is subject to a deterministic…
We analyze the dynamics of the Sisyphus random walk model, a discrete Markov chain in which the walkers may randomly return to their initial position $x_0$. In particular, we present a remarkably compact derivation of the time-dependent…