Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-24T14:44:32.926Z Has data issue: false hasContentIssue false

The Necklace Process

Published online by Cambridge University Press:  14 July 2016

Colin Mallows*
Affiliation:
Avaya Labs
Larry Shepp*
Affiliation:
Rutgers University
*
Postal address: Avaya Labs, 233 Mt. Airy Road, Basking Ridge, NJ 07920, USA. Email address: [email protected]
∗∗Postal address: Department of Statistics, 501 Hill Center, Busch Campus, Rutgers University, Piscataway, NJ 08854-8019, USA. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Start with a necklace consisting of one white bead and one black bead, and add new beads one at a time by inserting each new bead between a randomly chosen adjacent pair of old beads, with the proviso that the new bead will be white if and only if both beads of the adjacent pair are black. Let Wn denote the number of white beads when the total number of beads is n. We show that EWn = n/3 and, with c2 = 2/45, that (Wnn/3) / cn is asymptotically standard normal. We find that, for all r ≥ 1 and n > 2r, the rth cumulant of the distribution of Wn is of the form nhr. We find the expected numbers of gaps of given length between white beads, and examine the asymptotics of the longest gaps.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2008