On inference in a one-dimensional mosaic and an M/G/∞ queue
- 1 March 1985
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 17 (1) , 210-229
- https://doi.org/10.2307/1427060
Abstract
Suppose segments are distributed at random along a line, their locations being determined by a Poisson process. In the case where segment length is fixed, we compare efficiencies of several different estimates of Poisson intensity. The case of random segment length is also considered, and there we study estimation procedures based on empiric properties. The one-dimensional mosaic may be viewed as an M/G/∞ queue.Keywords
This publication has 10 references indexed in Scilit:
- Random coverage of the circle and asymptotic distributionsJournal of Applied Probability, 1982
- Covering the circle with random arcs of random sizesJournal of Applied Probability, 1982
- Binary Mosaics and the Spatial Pattern of HeatherPublished by JSTOR ,1981
- On Convergence of the Coverage by Random Arcs on a Circle and the Largest SpacingThe Annals of Probability, 1981
- On the lengths of the pieces of a stick broken at randomJournal of Applied Probability, 1980
- Multiple Coverage of the LineThe Annals of Probability, 1979
- Asymptotic Coverage Distributions on the CircleThe Annals of Probability, 1979
- Random arcs on the circleJournal of Applied Probability, 1978
- Random space filling and moments of coverage in geometrical probabilityJournal of Applied Probability, 1978
- The Theory of Random Clumping.Journal of the Royal Statistical Society Series C: Applied Statistics, 1969