arXiv Analytics

Sign in

arXiv:0807.4072 [cond-mat.stat-mech]AbstractReferencesReviewsResources

Sylvester's question and the Random Acceleration Process

H. J. Hilhorst, P. Calka, G. Schehr

Published 2008-07-25, updated 2008-09-17Version 2

Let n points be chosen randomly and independently in the unit disk. "Sylvester's question" concerns the probability p_n that they are the vertices of a convex n-sided polygon. Here we establish the link with another problem. We show that for large n this polygon, when suitably parametrized by a function r(phi) of the polar angle phi, satisfies the equation of the random acceleration process (RAP), d^2 r/d phi^2 = f(phi), where f is Gaussian noise. On the basis of this relation we derive the asymptotic expansion log p_n = -2n log n + n log(2 pi^2 e^2) - c_0 n^{1/5} + ..., of which the first two terms agree with a rigorous result due to Barany. The nonanalyticity in n of the third term is a new result. The value 1/5 of the exponent follows from recent work on the RAP due to Gyorgyi et al. [Phys. Rev. E 75, 021123 (2007)]. We show that the n-sided polygon is effectively contained in an annulus of width \sim n^{-4/5} along the edge of the disk. The distance delta_n of closest approach to the edge is exponentially distributed with average 1/(2n).

Comments: 29 pages, 4 figures; references added and minor changes
Journal: J. Stat. Mech. (2008) P10010
Categories: cond-mat.stat-mech
Related articles: Most relevant | Search more
arXiv:1001.1336 [cond-mat.stat-mech] (Published 2010-01-08, updated 2019-09-01)
Time to reach the maximum for a random acceleration process
Random acceleration process under stochastic resetting
arXiv:2105.05203 [cond-mat.stat-mech] (Published 2021-05-11, updated 2021-06-30)
Random acceleration process on finite intervals under stochastic restarting