Interval packing: the vacant interval distribution

Abstract

Starting at time 0, unit-length intervals arrive and are placed on the positive real line by a unit-intensity Poisson process in two dimensions; the left endpoints of intervals appear at the rate of 1 per unit time per unit distance. An arrival is accepted if and only if, for some given x, the interval is contained in 0 x and overlaps no interval already accepted. This stochastic, on-line interval packing problem generalizes the classical parking problem, the latter corresponding only to the absorbing states of the interval packing process, where successive packed intervals are separated by gaps less than or equal to 1 in length.In earlier work, the authors studied the distribution of the number of intervals accepted during 0 t . This paper is concerned with the vacant intervals (gaps) between consecutive packed intervals. Let p t y be the limit x → ∞ of the fraction of the gaps at time t which are at most y in length. We prove that 1 − e −v /v dv . We briefly discuss the recent importance acquired by interval packing models in connection with resource-reservation systems. In these applications, our vacant intervals correspond to times between consecutive reservation intervals. The results of this paper improve our understanding of the fragmentation of time that occurs in reservation systems.1. Introduction. Unit intervals arrive at random times and at random locations in R + . The arrival times and left endpoints comprise a unit-intensity Poisson process in two dimensions. Thus, the probability of an arrival in the time interval t t + dt with left endpoint in y y + dy is dt dy + o dt dy . The number of intervals packed entirely within 0 x during 0 t is denoted by I t x and has a mean denoted by K t x . In [3], it is shown that, for any given T > 0,

Large deviations for functionals of spatial point processes with applications to random packing and spatial graphs

“…(i) The family of functionals ðH x l Þ l and measures ðm x l Þ l satisfy weak laws of large numbers [19], central limit theorems [2,4,18], and moderate deviation principles [1]. In d ¼ 1 the analysis is somewhat simpler and has roots in Re´nyi [22] and Dvoretzky and Robbins [10], with later work by Coffman et al [6]. Corollary 2.1 shows that the Poissonized packing functionals and measures satisfy an LDP as well.…”

Statistical and renewal results for the random sequential adsorption model applied to a unidirectional multicracking problem

“…We now generalize (ii) in determining the joint density of the couple ðD e ; L e Þ: Fixing tXr; s 2 ½0; e; we use equality (19) of ðD e ; L e Þ and apply Slivnyak's formula (25) as in the proof of Lemma [5,4] constructed a point process on a finite interval, by the same erasing procedure as ours, and deduced analogous results by taking the limit when the length of the interval goes to infinity. Their work mostly used analytic tools such as Fourier transform and analytic functions.…”

“…He obtained the asymptotic behaviour of the mean number of points in ½0; L when L goes to infinity. This question, known as the car-parking problem, has been largely investigated (see for example [4,5,11,16,17]). …”

Queues with advanced reservations: an infinite-server proxy for the bookings diary

“…Virtamo [22] and Coffman et al [7]- [9] adopted a different approach. They analysed an interval-packing model, in which reservations of varying duration arrive to fill up space in an interval on the real line.…”