Abstract.
Points P 1 ,... ,P n in the unit square define a convex n -chain if they are below y=x and, together with P 0 =(0,0) and P n+1 =(1,1) , they are in convex position. Under uniform probability, we prove an almost sure limit theorem for these chains that uses only probabilistic arguments, and which strengthens similar limit shape statements established by other authors. An interesting feature is that the limit shape is a direct consequence of the method. The main result is an accompanying central limit theorem for these chains. A weak convergence result implies several other statements concerning the deviations between random convex chains and their limit.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received April 17, 1998, and in revised form December 4, 1998.
Rights and permissions
About this article
Cite this article
Bárány, I., Rote, G., Steiger, W. et al. A Central Limit Theorem for Convex Chains in the Square . Discrete Comput Geom 23, 35–50 (2000). https://doi.org/10.1007/PL00009490
Issue Date:
DOI: https://doi.org/10.1007/PL00009490