Number of Common Sites Visited by N Random Walkers

Abstract

We compute analytically the mean number of common sites, W_N(t), visited by N independent random walkers each of length t and all starting at the origin at t=0 in d dimensions. We show that in the (N-d) plane, there are three distinct regimes for the asymptotic large t growth of W_N(t). These three regimes are separated by two critical lines d=2 and d=d_c(N)=2N/(N-1) in the (N-d) plane. For d<2, W_N(t)\sim t^{d/2} for large t (the N dependence is only in the prefactor). For 2<d<d_c(N), W_N(t)\sim t^ν where the exponent ν= N-d(N-1)/2 varies with N and d. For d>d_c(N), W_N(t) approaches a constant as t\to \infty. Exactly at the critical dimensions there are logaritmic corrections: for d=2, we get W_N(t)\sim t/[\ln t]^N, while for d=d_c(N), W_N(t)\sim \ln t for large t. Our analytical predictions are verified in numerical simulations.

5 pages, 3 .eps figures included

References in corpus (1)

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

Cited by in corpus (12)

• Extreme value statistics of correlated random variables: a pedagogical review
• Exploration and Trapping of Mortal Random Walkers
• Exact distributions of the number of distinct and common sites visited by N independent random walkers
• Number of distinct sites visited by a resetting random walker
• Many-body contacts in fractal polymer chains and fBm trajectories
• The average number of distinct sites visited by a random walker on random graphs
• Exact distributions of cover times for $N$ independent random walkers in one dimension
• Records for the number of distinct sites visited by a random walk on the fully-connected lattice
• Probability distribution of the number of distinct sites visited by a random walk on the finite-size fully-connected lattice
• Lattice gases with a point source
• Overlap of two Brownian trajectories: exact results for scaling functions
• Statistical properties of sites visited by independent random walks