Suppose I have an interval of length $x$ and I want to drop $n$ sticks of unit length onto it (where $\sqrt x<n<x$). What is the expected overlap between sticks? ($x$ can be assumed to be large enough that edge effects are negligible.)
I assume this is a standard problem and has a name but I don't know it. It's related to the birthday problem, a discrete version of this problem, and also to Rényi's parking problem which disallows overlap rather than measuring it.
I suppose there are at least two ways to measure overlap: the total length of the interval covered by more than one stick, or the same weighted by the number of sticks, less 1, at that point. The second is slightly more natural in my application, but I'd be happy with either.
Edit: I found Comparing Continuous and Discrete Birthday Coincidences: “Same-Day” versus “Within 24 Hours” (2010) which discusses finding the probability of any overlap in my model, rather than the expected length of the overlap.