Number of distinct sites visited by N random walkers on a Euclidean lattice

Abstract

The evaluation of the average number S_N(t) of distinct sites visited up to time t by N independent random walkers all starting from the same origin on an Euclidean lattice is addressed. We find that, for the nontrivial time regime and for large N, S_N(t) \approx \hat S_N(t) (1-Δ), where \hat S_N(t) is the volume of a hypersphere of radius (4Dt \ln N)^{1/2}, Δ={1/2}\sum_{n=1}^\infty \ln^{-n} N \sum_{m=0}^n s_m^{(n)} \ln^{m} \ln N, d is the dimension of the lattice, and the coefficients s_m^{(n)} depend on the dimension and time. The first three terms of these series are calculated explicitly and the resulting expressions are compared with other approximations and with simulation results for dimensions 1, 2, and 3. Some implications of these results on the geometry of the set of visited sites are discussed.

15 pages (RevTex), 4 figures (eps); to appear in Phys. Rev. E

Cited by in corpus (9)

• Number of distinct sites visited by a resetting random walker
• Order statistics of the trapping problem
• Number of Common Sites Visited by N Random Walkers
• Multiparticle trapping problem in the half-line
• Survival probability and order statistics of diffusion on disordered media
• Probability distribution of the number of distinct sites visited by a random walk on the finite-size fully-connected lattice
• Order statistics of Rosenstock's trapping problem in disordered media
• Lattice gases with a point source
• Dynamics of unvisited sites in presence of mutually repulsive random walkers