Let n points be placed uniformly at random on the boundary...

Let $n$ points be placed uniformly at random on the boundary of a circle of circumference 1 . These $n$ points divide the circle into $n$ arcs. Let $Z_{i}$ for $1 \leq Z_{i} \leq n$ be the length of these arcs in some arbitrary order. (a) Prove that all $Z_{i}$ are at most $c \ln n /(n-1)$ with probability at least $1-1 / n^{c-1}$. (b) Prove that, for sufficiently large $n$, there exists a constant $c^{\prime}$ such that at least one $Z_{i}$ is at least $c^{\prime} \ln n$ with probability at least $1 / 2$. (Hint: Use the second moment method.) (c) Prove that all $Z_{i}$ are at least $1 / 2 n^{2}$ with probability at least $1 / 2$. (d) Prove that, for sufficiently large $n$, there exists a constant $c^{\prime}$ such that at least one $Z_{i}$ is at most $c^{\prime} / n^{2}$ with probability at least $1 / 2$. (Hint: Use the second moment method.) (e) Explain how these results relate to the following problem: $X_{1}, X_{2}, \ldots, X_{n-1}$ are values chosen independently and uniformly at random from the real interval $[0,1]$. We let $Y_{1}, Y_{2}, \ldots, Y_{n-1}$ represent these values in increasing sorted order, and we also define $Y_{0}=0$ and $Y_{n}=1$. The points $Y_{t}$ break the unit interval into $n$ segments. What can we say about the shortest and longest of these segments?

Let $n$ points be placed uniformly at random on the boundary of a circle of circumference 1 . These $n$ points divide the circle into $n$ arcs. Let $Z_{i}$ for $1 \leq Z_{i} \leq n$ be the length of these arcs in some arbitrary order.
(a) Prove that all $Z_{i}$ are at most $c \ln n /(n-1)$ with probability at least $1-1 / n^{c-1}$.
(b) Prove that, for sufficiently large $n$, there exists a constant $c^{\prime}$ such that at least one $Z_{i}$ is at least $c^{\prime} \ln n$ with probability at least $1 / 2$. (Hint: Use the second moment method.)
(c) Prove that all $Z_{i}$ are at least $1 / 2 n^{2}$ with probability at least $1 / 2$.
(d) Prove that, for sufficiently large $n$, there exists a constant $c^{\prime}$ such that at least one $Z_{i}$ is at most $c^{\prime} / n^{2}$ with probability at least $1 / 2$. (Hint: Use the second moment method.)
(e) Explain how these results relate to the following problem: $X_{1}, X_{2}, \ldots, X_{n-1}$ are values chosen independently and uniformly at random from the real interval $[0,1]$. We let $Y_{1}, Y_{2}, \ldots, Y_{n-1}$ represent these values in increasing sorted order, and we also define $Y_{0}=0$ and $Y_{n}=1$. The points $Y_{t}$ break the unit interval into $n$ segments. What can we say about the shortest and longest of these segments?

Key Concepts

Uniform Distribution on a Circle

This concept involves placing points on the circumference of a circle such that each location is equally likely to be chosen. This uniformity ensures that all parts of the circle are equally probable, which is fundamental when analyzing the resulting arcs or segments created by these points. This concept is central to problems involving randomness on geometric objects and sets the stage for studying the statistical properties of the segments produced.

Order Statistics and Spacings

Order statistics focuses on the sorted values from a sample of random variables. In the context of points on a circle (or an interval), once the points are sorted, the differences between consecutive points (or between a point and the beginning/end of the interval) form what are known as spacings. Analyzing these spacings allows for the study of properties such as the longest and shortest segments, which is essential for understanding the distribution of gaps or arcs created in the problem.

Extreme Value Analysis

Extreme value analysis deals with determining the behavior of the largest or smallest values in a collection of random variables. In this problem, determining bounds for the longest and shortest arcs involves extreme value theory. The study of extremes is critical in probabilistic settings where one wishes to understand the limits or rare events—such as unusually large or small gaps—occurring in systems with many random components.

Second Moment Method

The second moment method is a probabilistic technique used to show the existence of certain events by comparing the square of the expectation with the expectation of the square. It is particularly useful in proving lower bounds on the probability of an event occurring. In this context, it is applied to demonstrate that with a significant probability, at least one of the segments (or arcs) attains an extreme value (either very long or very short).

Concentration Inequalities

Concentration inequalities provide bounds that quantify how a random variable deviates from some central value, typically its mean. They are used to establish high-probability bounds that all arcs or segments fall within a certain range. In this problem, these inequalities are instrumental in showing that with high probability, all arcs remain below a specified upper bound or above a minimal lower bound, ensuring the segments are not overly irregular.

Transcript

Please give Ace some feedback