Longest convex chains
classification
🧮 math.PR
math.CO
keywords
convexlongestchainsrandomaroundarticleassumechain
read the original abstract
Assume $X_n$ is a random sample of $n$ uniform, independent points from a triangle $T$. The longest convex chain, $Y$, of $X_n$ is defined naturally. The length $|Y|$ of $Y$ is a random variable, denoted by $L_n$. In this article, we determine the order of magnitude of the expectation of $L_n$. We show further that $L_n$ is highly concentrated around its mean, and that the longest convex chains have a limit shape.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.