Library · Geometric Probability · Chapter 48

Expected lengths of the three broken-stick pieces

Revised Report an error

Problem 48.1

A unit stick is broken at two independent uniform random points, producing three pieces. Let SS, MM, LL denote the shortest, middle, and longest of the three piece-lengths respectively. Compute E[S]\mathbb{E}[S], E[M]\mathbb{E}[M], and E[L]\mathbb{E}[L].

Solution. The three pieces sum to 11, so the three expectations sum to 11. The pieces are exchangeable (invariant under relabelling), but their order statistics S,M,LS, M, L have different distributions and hence different means.

Step 1: density of the simplex. The pieces (a,b,c)(a, b, c) with a+b+c=1a + b + c = 1 and a,b,c≥0a, b, c \geq 0 are uniform on the 22-simplex with density 22 (the simplex has area 1/21/2).

Step 2: E[S]\mathbb{E}[S] via tail integration. Compute P(S>t)=P(every piece>t)\mathbb{P}(S > t) = \mathbb{P}(\text{every piece} > t). The event requires a>ta > t, b>tb > t, and 1−a−b>t1 - a - b > t, which describes a smaller simplex of side 1−3t1 - 3t. Thus P(S>t)=(1−3t)2,0≤t≤13.\mathbb{P}(S > t) = (1 - 3t)^2, \qquad 0 \leq t \leq \tfrac13. Therefore E[S]=∫01/3(1−3t)2 dt=[−(1−3t)39]01/3=19.\mathbb{E}[S] = \int_0^{1/3} (1 - 3t)^2 \, dt = \left[ -\tfrac{(1-3t)^3}{9} \right]_0^{1/3} = \tfrac19.

Step 3: E[L]\mathbb{E}[L] via inclusion–exclusion. The longest piece exceeds tt iff some piece does. The three events {a>t}\{a > t\}, {b>t}\{b > t\}, {c>t}\{c > t\} have pairwise and triple intersections computable from the simplex density. By inclusion–exclusion, P(L>t)=3P(a>t)−3P(a>t,b>t)+P(a>t,b>t,c>t).\mathbb{P}(L > t) = 3 \mathbb{P}(a > t) - 3 \mathbb{P}(a > t, b > t) + \mathbb{P}(a > t, b > t, c > t). Compute each term for t∈[0,1]t \in [0, 1] (the pairwise and triple terms vanish when t>1/2t > 1/2 and t>1/3t > 1/3 respectively). After integration one obtains E[L]=1118.\mathbb{E}[L] = \frac{11}{18}.

Step 4: E[M]\mathbb{E}[M] by subtraction. Since S+M+L=1S + M + L = 1, E[M]=1−E[S]−E[L]=1−19−1118=518.\mathbb{E}[M] = 1 - \mathbb{E}[S] - \mathbb{E}[L] = 1 - \tfrac19 - \tfrac{11}{18} = \tfrac{5}{18}.

In summary, E[S]=19,E[M]=518,E[L]=1118.■\boxed{\mathbb{E}[S] = \tfrac{1}{9}, \qquad \mathbb{E}[M] = \tfrac{5}{18}, \qquad \mathbb{E}[L] = \tfrac{11}{18}.} \qedhere

The values 19,518,1118\tfrac{1}{9}, \tfrac{5}{18}, \tfrac{11}{18} are the first three elements of a harmonic-number pattern: for nn iid uniform points on [0,1][0, 1] producing n+1n + 1 pieces, the expected kk-th order statistic piece is E[S(k)]=1n+1∑j=1k1n+2−j.\mathbb{E}[S_{(k)}] = \frac{1}{n + 1} \sum_{j = 1}^{k} \frac{1}{n + 2 - j}. Setting n=2n = 2: E[S(1)]=13⋅13=19\mathbb{E}[S_{(1)}] = \tfrac{1}{3} \cdot \tfrac{1}{3} = \tfrac19, E[S(2)]=13(13+12)=518\mathbb{E}[S_{(2)}] = \tfrac{1}{3}(\tfrac13 + \tfrac12) = \tfrac{5}{18}, E[S(3)]=13(13+12+1)=1118\mathbb{E}[S_{(3)}] = \tfrac13(\tfrac13 + \tfrac12 + 1) = \tfrac{11}{18}, confirming the above. This is the formula of David and Nagaraja (Order Statistics, Wiley 2003) and has appeared many times on math.stackexchange as a classical exercise.

import numpy as np
x, y = np.random.rand(2, 10**7)
lo, hi = np.minimum(x, y), np.maximum(x, y)
pieces = np.stack([lo, hi - lo, 1 - hi])
sorted_pieces = np.sort(pieces, axis=0)
print(f"E[S] sim: {sorted_pieces[0].mean():.5f}  exact: {1/9:.5f}")
print(f"E[M] sim: {sorted_pieces[1].mean():.5f}  exact: {5/18:.5f}")
print(f"E[L] sim: {sorted_pieces[2].mean():.5f}  exact: {11/18:.5f}")
# E[S] sim: 0.11116  exact: 0.11111
# E[M] sim: 0.27782  exact: 0.27778
# E[L] sim: 0.61102  exact: 0.61111
Report an error on this page

Reports are stored by Netlify. See the privacy note.