How can I calculate the minimum distance from the center to N points uniformly distributed in a circle? In other words, I want to find the distance to the closest point from the center. Does this distance decrease with N?
As for the decrease, it is obvious that the minimum distance from the center to points decreases with . Just give it a thought.
I show you how to find the distribution of the minimum distance from the center to points uniformly chosen in a disk.
First thing is to consider only one point uniformly distributed in a disk. I will consider a disk with center and radius . Let (i.e. is the distance from to ).
For , we have of course , and if then (because means that is inside the circle with radius , and the probability to be in a subset of the disk is proportional to its area). Using this computation, you can get the density of the distribution of (by differentiating, it is on and 0 elsewhere), and the expectation of .
Now, suppose there are independent points uniformly chosen on the same disk, and let be the minimum distance from the center to the points, i.e. where are defined like the previous , for each of the points.
Then we have , from which we can get the density of the distribution of : it is on .
Sorry, my question was if N points are uniformly distributed in a sector of area , can i then write the pdf as on [0,r]. Can I compute the expected value of d from the pdf by integrating over the area of sector ?(varying t from 0 to r and theta from 0 to thetamax - say pi/2). Also it doesn't matter (or does it ?) if d is minimum or maximum of R1, R2....RN ?. Please let me know.
But you can find the distribution of the max using the same procedure as I did for the min: , and deduce the expected value using for instance .
Since the distribution of the points is rotation-invariant, this property is the same for any sector of radius .