Computing expected moments of the Rényi parking problem on the circle

Authors

DOI:

https://doi.org/10.21914/anziamj.v64.17955

Keywords:

piecewise polyomial approximation, point processes, one dimensional random packing, lower triangular linear systems

Abstract

A highly accurate and efficient method to compute the expected values of the count, sum, and squared norm of the sum of the centre vectors of a random maximal sized collection of non-overlapping unit diameter disks touching a fixed unit-diameter disk is presented. This extends earlier work on Renyi's parking problem [Magyar Tud. Akad. Mat. Kutato Int. Kozl. 3 (1–2), 1958, pp. 109–127]. Underlying the method is a splitting of the the problem conditional on the value of the first disk. This splitting is proven and then used to derive integral equations for the expectations. These equations take a lower block triangular form. They are solved using substitution and approximation of the integrals to very high accuracy using a polynomial approximation within the blocks.

References

  • J. Bezanson, A. Edelman, S. Karpinski, and V. B. Shah. Julia: A fresh approach to numerical computing. SIAM Review 59.1 (2017), pp. 65–98. doi: 10.1137/141000671
  • M. P. Clay and N. J. Simányi. Rényi’s parking problem revisited. Stoch. Dyn. 16.2, 1660006 (2016). doi: 10.1142/S0219493716600066
  • Institute of Mathematical Statistics. Selected translations in mathematical statistics and probability. Vol. 4. American Mathematical Society, Providence, RI, 1963
  • M. Lal and P. Gillard. Evaluation of a constant associated with a parking problem. Math. Comp. 28 (1974), pp. 561–564. doi: 10.2307/2005927
  • G. Marsaglia, A. Zaman, and J. C. W. Marsaglia. Numerical solution of some classical differential-difference equations. Math. Comp. 53 (1989), pp. 191–201. doi: 10.2307/2008355
  • S. Olver. ApproxFun.jl v0.13.14. 2023. url: https://github.com/JuliaApproximation/ApproxFun.jl
  • S. Olver and A Townsend. A practical framework for infinite-dimensional linear algebra. Proceedings of the First Workshop for High Performance Technical Computing in Dynamic Languages. 2014, pp. 57–62. doi: 10.1109/HPTCDL.2014.10
  • A. Rényi. On a one-dimensional problem concerning random space filling. Publ. Math. Inst. Hung. Acad. Sci 3.1–2 (1958), pp. 109–127
  • H. Weiner. Elementary Treatment of the Parking Problem. Sankhya: Indian J. Stat., A (1961–2002) 31.4 (1969), pp. 483–486. url: http://www.jstor.org/stable/25049616

Published

2024-01-15

Issue

Vol. 64 (2022)

Section

Proceedings Computational Techniques and Applications Conference