Skip to main content
SpringerLink
Log in

Coalescing Particles on an Interval

  • Published:
Journal of Theoretical Probability Aims and scope Submit manuscript

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)?

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCE

  1. Schabanel, N. (1996). Equilibrage AVL distribué d'arbres binaires de recherche. DEA thesis, Ecole Normale de Lyon.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indiana University, Bloomington, Indiana, 47405-5701

    Michael Larsen

  2. Department of Mathematics, Indiana University, Bloomington, Indiana 47405-5701

    Russell Lyons

Authors
  1. Michael Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Russell Lyons
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Larsen, M., Lyons, R. Coalescing Particles on an Interval. Journal of Theoretical Probability 12, 201–205 (1999). https://doi.org/10.1023/A:1021704912660

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021704912660

Search

Navigation