5 research outputs found
Number of distinct sites visited by N random walkers on a Euclidean lattice
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-\Delta), where \hat S_N(t) is
the volume of a hypersphere of radius (4Dt \ln N)^{1/2},
\Delta={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.Comment: 15 pages (RevTex), 4 figures (eps); to appear in Phys. Rev.
Survival probability and order statistics of diffusion on disordered media
We investigate the first passage time t_{j,N} to a given chemical or
Euclidean distance of the first j of a set of N>>1 independent random walkers
all initially placed on a site of a disordered medium. To solve this
order-statistics problem we assume that, for short times, the survival
probability (the probability that a single random walker is not absorbed by a
hyperspherical surface during some time interval) decays for disordered media
in the same way as for Euclidean and some class of deterministic fractal
lattices. This conjecture is checked by simulation on the incipient percolation
aggregate embedded in two dimensions. Arbitrary moments of t_{j,N} are
expressed in terms of an asymptotic series in powers of 1/ln N which is
formally identical to those found for Euclidean and (some class of)
deterministic fractal lattices. The agreement of the asymptotic expressions
with simulation results for the two-dimensional percolation aggregate is good
when the boundary is defined in terms of the chemical distance. The agreement
worsens slightly when the Euclidean distance is used.Comment: 8 pages including 9 figure
Random Convex Hulls and Extreme Value Statistics
In this paper we study the statistical properties of convex hulls of
random points in a plane chosen according to a given distribution. The points
may be chosen independently or they may be correlated. After a non-exhaustive
survey of the somewhat sporadic literature and diverse methods used in the
random convex hull problem, we present a unifying approach, based on the notion
of support function of a closed curve and the associated Cauchy's formulae,
that allows us to compute exactly the mean perimeter and the mean area enclosed
by the convex polygon both in case of independent as well as correlated points.
Our method demonstrates a beautiful link between the random convex hull problem
and the subject of extreme value statistics. As an example of correlated
points, we study here in detail the case when the points represent the vertices
of independent random walks. In the continuum time limit this reduces to
independent planar Brownian trajectories for which we compute exactly, for
all , the mean perimeter and the mean area of their global convex hull. Our
results have relevant applications in ecology in estimating the home range of a
herd of animals. Some of these results were announced recently in a short
communication [Phys. Rev. Lett. {\bf 103}, 140602 (2009)].Comment: 61 pages (pedagogical review); invited contribution to the special
issue of J. Stat. Phys. celebrating the 50 years of Yeshiba/Rutgers meeting