Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-25T06:14:16.419Z Has data issue: false hasContentIssue false

Tight bound of random interval packing

Published online by Cambridge University Press:  14 July 2016

Wansoo T. Rhee*
Affiliation:
Ohio State University
*
Postal address: Department of Management Science, The Ohio State University, Columbus, OH 43210, USA.

Abstract

Consider n random intervals I1, …, IN chosen by selecting endpoints independently from the uniform distribution. A packing of I1, …, IN is a disjoint sub-collection of these intervals: its wasted space is the measure of the set of points not covered by the packing. We investigate the random variable WN equal to the smallest wasted space among all packings. Coffman, Poonen and Winkler proved that EWN is of order (log N)2/N. We provide a sharp estimate of log P(WNt (log N)2 / N) and log P(WNt (log N)2 / N) for all values of t.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1998 

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

Footnotes

Research supported in part by NSF contract DMS-9303188.

References

Coffman, E. G. Jr, and Lueker, G. S. (1991). Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, New York.Google Scholar
Coffman, E. G. Jr, Poonen, B., and Winkler, P. (1995). Packing random intervals. Prob. Theory Rel. Fields 102, 105121.CrossRefGoogle Scholar
Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58, 1330.CrossRefGoogle Scholar
Rhee, W. T., and Talagrand, M. (1996). Packing random intervals. Ann. Appl. Prob. 6, 572576.CrossRefGoogle Scholar