Maximum gaps in one-dimensional hard-core models
From MaRDI portal
Publication:6177613
Abstract: We study the distribution of the maximum gap size in one-dimensional hard-core models. First, we randomly sequentially pack rods of length onto an interval of length , 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 between adjacent rods, but there are gaps of size at least for all . We subsequently study a variant of the hard-core process, the one-dimensional ghost hard-core model introduced by Torquato and Stillinger. In this model, we randomly sequentially pack rods of length onto an interval of length , 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 but at least for all
Recommendations
- On maximal hard-core thinnings of stationary particle processes
- A multitype random sequential process. II. Distribution of particle size and vacant space length in the saturation limit
- On a class of growth-maximal hardcore processes
- The Minimum of Gaps Generated by Random Packing of Unit Intervals into a Large Interval
- Hard Core via PCA: Entropy Bounds
Cites work
- Gaussian limits for multidimensional random sequential packing at saturation
- Hard rods: statistics of parking configurations
- scientific article; zbMATH DE number 3890593 (Why is no real title available?)
- scientific article; zbMATH DE number 3171475 (Why is no real title available?)
- scientific article; zbMATH DE number 3396865 (Why is no real title available?)
- On random sequential packing in the plane and a conjecture of palasti
- On the lengths of the pieces of a stick broken at random
- On the minimum of gaps generated by one-dimensional random packing
- Random sequential adsorption: Relationship to dead leaves and characterization of variability
- Random sequential packing in Euclidean spaces of dimensions three and four and a conjecture of Palásti
- Random sequential packing of cubes
- Statistical mechanics: Algorithms and computations. With CD-ROM.
- Stochastic geometry and its applications
- The Minimum of Gaps Generated by Random Packing of Unit Intervals into a Large Interval
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
This page was built for publication: Maximum gaps in one-dimensional hard-core models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6177613)