Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T22:04:45.725Z Has data issue: false hasContentIssue false
  • English
  • Français

Random coverings of the circle by arcs with restricted endpoints

Published online by Cambridge University Press:  14 July 2016

Svante Janson
Svante Janson*
Affiliation:
Uppsala University
*
∗ Postal address: Department of Mathematics, Uppsala University, Thunbergsvägen 3, S-752 38 Uppsala, Sweden.
Get access Rights & Permissions [Opens in a new window]

Abstract

A circle is covered by random arcs with a given length a and endpoints chosen (independently and uniformly) among m equispaced points on the circle. The asymptotic distribution as a → 0 and m → ∞of the number of arcs required for complete coverage is given. The result connects earlier results for the cases ma = 1 (a discrete problem) and m = ∞ (the continuous limiting case).

Keywords

COUPON COLLECTION
Type
Short Communications
Information
Journal of Applied Probability , Volume 25 , Issue 1 , March 1988 , pp. 215 - 219
Copyright
Copyright © Applied Probability Trust 1988 

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

References

Erdös, P. and Renyi, A. (1961) On a classical problem in probability theory. Magyar Tud. Akad. Kutato Int. Közl. 6, 215–219.Google Scholar
Flatto, L. (1973) A limit theorem for random coverings of a circle. Israel J. Math. 15, 167–184.CrossRefGoogle Scholar
Holst, L. (1985) On discrete spacings and the Bose-Einstein distribution. Contributions to Probability and Statistics in Honour of Gunnar Blom , Studentlitteratur, Lund, 169–177.Google Scholar
Janson, S. (1985) On waiting times in games with disasters. Contributions to Probability and Statistics in Honour of Gunnar Blom , Studentlitteratur, Lund, 195–204.Google Scholar