# 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} }

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

6 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 12 REFERENCES

Sequential Filling of a Line by Intervals Placed at Random and Its Application to Linear Adsorption

- Chemistry
- 1962

44

Association Problem in Statistical Mechanics—Critique of the Treatment of H. S. Green and R. Leipnik

- Physics
- 1960

8

; Lewinter , Marty Discrete Rényi parking constants

- 2005

Association problem in statistical mechanics

- 1960