Expected Number of Chord Intersections Inside a Circle

MediumProbability

Reported in interviews at DRW Hudson River Trading

Problem statement

Choose $n$ points uniformly at random on a circle and connect every pair with a chord, forming $\binom{n}{2}$ chords in total. What is the expected number of intersection points strictly inside the circle?

Assume no three chords are concurrent (which holds with probability 1 for random points).

Show hint

Is there a more natural object than a pair of chords that pins down exactly one interior crossing point?

Relevant roles: Data Scientist, Applied Scientist and Research Scientist.

Related free problems