Number of distinct sites visited by N random walkers.

@article{Larralde1992NumberOD,
  title={Number of distinct sites visited by N random walkers.},
  author={Larralde and Trunfio and Havlin and Stanley and Weiss},
  journal={Physical review. A, Atomic, molecular, and optical physics},
  year={1992},
  volume={45 10},
  pages={
          7128-7138
        }
}
  • Larralde, Trunfio, +2 authors Weiss
  • Published 1992
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and optical physics
We study the number of distinct sites visited by N random walkers after t steps Siv(t) under the condition that all the walkers are initially at the origin. We derive asymptotic expressions for the mean number of distinct sites (Siv(t)) in one, two, and three dimensions. We find that (Siv(t)) passes through several growth regimes; at short times (Siv(t)) ~ t" (regime I), for t» & t & t'„we find that (Siv(t)) ~ (t ln[N Si(t)/t ])" (regime II), and for t & t'„,(Siv(t)) ~ NSi(t) (regime III). The… Expand

Figures and Tables from this paper

Number of common sites visited by N random walkers.
  • S. Majumdar, M. Tamm
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2012
TLDR
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 is computed analytically. Expand
Exact distributions of the number of distinct and common sites visited by N independent random walkers.
TLDR
It is shown that these two random variables can be mapped onto extreme value quantities associated with N independent random walkers and compute exactly their probability distributions for any value of N in the limit of large time t, where the randomWalkers can be described by Brownian motions. Expand
Record statistics for multiple random walks.
TLDR
The statistics of the number of records R(n,N) for N identical and independent symmetric discrete-time random walks of n steps in one dimension find that the mean record number grows universally as ~α(N) sqrt[n] for large n, but with a very different behavior of the amplitude α(N] for N>1 in the two cases. Expand
Order statistics of Rosenstock's trapping problem in disordered media.
  • S. B. Yuste, L. Acedo
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
TLDR
Simulation results for the two-dimensional incipient percolation aggregate confirm the predictions of the approach and show that the ratio between the nth cumulant and the n fourth moment of S(N)(t) is, for large N, very large in comparison with the same ratio in Euclidean media, and almost constant. Expand
Expected number of distinct sites visited by N random walks in the presence of an absorbing boundary
In earlier work we have studied the expected number of distinct sites (ENDS) visited by N random walkers in time t on a translationally invariant lattice. Optical applications suggest the interest inExpand
Diffusion of a set of random walkers in Euclidean media. First passage times
When a large numberN of independent random walkers diffuse on ad-dimensional Euclidean substrate, what is the expectation valueht1;Ni of the time spent by the first random walker to cross a givenExpand
Multiparticle trapping problem in the half-line
A variation of Rosenstock's trapping model in which N independent random walkers are all initially placed upon a site of a one-dimensional lattice in the presence of a one-sided random distributionExpand
“True” self-attracting walk
Abstract The self-attracting walk (SATW) model was extended and investigated by Monte Carlo simulations. In the extended two-dimensional model, the environment parameter n i , j takes the value ofExpand
Distinct nodes visited by random walkers on scale-free networks
TLDR
This work shows that the fraction of nodes of scale-free network not visited by random walkers in time $t$ has a stretched exponential form independent of the details of the network and number of walkers. Expand
The expected number of distinct sites visited by N biased random walks in one dimension
We calculate the asymptotic form of the expected number of distinct sites visited by N random walkers moving independently in one dimension. It is shown that to lowest order and at long times, theExpand
...
1
2
3
4
5
...

References