Random Polygon Intersections on a Circle

This random-polygon question is about understanding how many times the edges of a closed path on a circle are expected to cross inside, when the vertices are sampled independently and uniformly. It sits at the intersection of geometric probability, combinatorics, and expected-value calculations, and is a classic style of quant prep puzzle used in high-level interviews. At top trading firms, it probes how you think about randomness in continuous settings, not just discrete toys.

It trains your ability to formalize symmetry, use invariance, and reason about expectation without brute-force enumeration. You need to recognize when complex-looking geometric randomness can be reduced to counting structured subconfigurations and assigning them probabilities, a core skill for challenging quant interviews.

This matters for quant interviews because many trading and research problems involve random structures where direct simulation or enumeration is impossible. Interviewers want to see whether your quant prep has given you the reflex to turn messy random setups into clean expectation identities, exploiting linearity, symmetry, and combinatorial structure. Being fluent with these ideas is exactly what distinguishes strong candidates in competitive quant interviews.

What it tests

When analyzing expected intersections among randomly drawn chords connecting points on a circle, the core structure is combinatorial symmetry and invariance under relabeling. The key is that the probability of intersection between two chords depends only on the relative order of their endpoints, not their absolute positions. This is because the circle's symmetry means any set of four distinct points is equivalent up to rotation, so the intersection probability is uniform across all unordered pairs of chords that do not share an endpoint. The principle generalizes: whenever a problem involves random pairings or connections among points on a symmetric structure, the expected number of certain configurations (like intersections) can often be reduced to counting the number of possible pairs and multiplying by the probability for a representative pair, thanks to symmetry and linearity of expectation. This approach bypasses the need to enumerate all configurations explicitly by leveraging uniformity.