Let $U \in \mathbb{R}^3$ be distributed uniformly in the Ball in $\mathbb{R}^3$ centered at zero. That is $U \sim f_U(u)= \frac{1}{ \frac{4}{3} \pi R^3}$ for all $\|u\|\le R$ where $R$ is the radius of the ball.
Now suppose we generate $n$ points i.i.d. according distribution of $U$.
My questions is: Can we compute the expected minimum distance between the generated points, that is \begin{align} E\left[ \min_{i,j\in \{1,2,,,n\}} \| U_i-U_j\| \right], \end{align} where $\| U_i-U_j\|$ is Euclidean distance.
This question is related to a number of other questions.
For example, Average distance between two random points in a square
Average minimum distance between $n$ points generate i.i.d. with uniform dist.
I feel that this question should have been addressed before but not sure where to look.
There is a conjecture that the minimum distance behaves as $\frac{1}{n^{\frac{2}{3}}}$ but I am not sure how to show this?
Update See a recently add proof of this statement for the case when 'border' effects are negligible. That is the answer is asymptotic. The question know is how to take into account the border effects?
Thank you very much.