ISSN:
1572-9230
Keywords:
Coalescence
;
random walk
;
asymptotics
;
parallel processing
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract At time 0, we begin with a particle at each integer in [0, n]. At each positive integer time, one of the particles remaining in [1, n] is chosen at random and moved one to the left, coalescing with any particle that might already be there. How long does it take until all particles coalesce (at 0)?
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1021704912660