Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-12T07:08:03.160Z Has data issue: false hasContentIssue false

Random packing of an interval

Published online by Cambridge University Press:  01 July 2016

David Mannion*
Affiliation:
Royal Holloway College, London

Abstract

At each stage of the packing of a closed interval K, a random number of random open intervals (the packing objects) are placed in that part of K which is as yet unoccupied. No overlapping between the packing objects is allowed. The packing prescription is such that the packing process terminates after at most a finite number of stages. Attention is focused on the final configuration, K = K – + G, where G is a random open subset of K, and is that part of K which is eventually occupied by packing objects, while K –, a random closed subset of K, is that part of K which remains unoccupied.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1976 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable