A note on packing random intervals with varying density

It is known that given N random subintervals of [0, 1], one can find a disjoint subcollection that covers all of [0, 1] except a set of length about (log N)2/N. We investigate what happens when the distribution of the intervals is biased to favor shorter intervals or intervals close to the endpoints of [0, 1]. Quite surprizingly, the order (log N)2/N is very robust.

MoreLess

Year of publication:	1999
Authors:	Rhee, WanSoo T.
Published in:	Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 41.1999, 2, p. 199-208
Publisher:	Elsevier

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005224075