Maximum gaps in one-dimensional hard-core models

Abstract

We study the distribution of the maximum gap size in one-dimensional hard-core models. First, we sequentially pack rods of length 2 into an interval of length L at random, subject to the hard-core constraint that rods do not overlap. We find that in a saturated packing, with high probability there is no gap of size $2-o(L^{-1})$ between adjacent rods, but there are gaps of size at least $2-L^{\mathit{\epsilon }-1}$ for all $\mathit{\epsilon }>0$.

We subsequently study a dependent thinning-based variant of the hard-core process, the one-dimensional “ghost” hard-core model. In this model, we sequentially pack rods of length 2 into an interval of length L at random, such that placed rods neither overlap with previously placed rods nor previously considered candidate rods. We find that in the infinite time limit, with high probability the maximum gap between adjacent rods is smaller than $logL$ but at least ${(logL)}^{1-\mathit{\epsilon }}$ for all $\mathit{\epsilon }>0$.