Rényi’s parking problem revisited

@article{Clay2016RnyisPP,
  title={R{\'e}nyi’s parking problem revisited},
  author={M. P. Clay and N. Sim{\'a}nyi},
  journal={Stochastics and Dynamics},
  year={2016},
  volume={16},
  pages={1660006}
}
  • M. P. Clay, N. Simányi
  • Published 2016
  • Mathematics
  • Stochastics and Dynamics
  • Renyi’s parking problem (or 1D sequential interval packing problem) dates back to 1958, when Renyi studied the following random process: Consider an interval I of length x, and sequentially and randomly pack disjoint unit intervals in I until the remaining space prevents placing any new segment. The expected value of the measure of the covered part of I is M(x), so that the ratio M(x)/x is the expected filling density of the random process. Following recent work by Gargano et al. [4], we… CONTINUE READING

    Figures from this paper.

    Last-mile shared delivery: A discrete sequential packing approach
    2
    Marking Streets to Improve Parking Density
    On the diminishing process of B. T\'oth
    On ballistic deposition process on a strip.
    3
    Errata and Addenda to Mathematical Constants

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES
    On the „Parking“ Problem
    27
    Random packing density
    25
    RANDOM PACKING OF AN INTERVAL. II
    10
    Free Radical Statistics
    9
    A Note on Vacancies on a Line
    4
    ; Lewinter , Marty Discrete Rényi parking constants
    • 2005
    Association problem in statistical mechanics
    • 1960