Timeline for density of distance between points in unit circles
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2015 at 17:17 | comment | added | Mudi | Yes, I am sorry I meant to choose uniformly from the interior of circle. When $a=b$, the expression doesn’t look pretty (not to me at least) but the argument/procedure is simple enough (It’s described in Tuckwell’s Applications of Probability Theory). Anyway here it is. $f_X(x) = \frac{2x}{\pi r^2}( 2 \arccos(\frac{x}{2r}) - \frac{x}{r} \sqrt{ 1-{(\frac{x}{2r}) }^2} )$. | |
| Nov 11, 2015 at 16:39 | comment | added | Igor Rivin | What do you get when $a=b?$ | |
| Nov 11, 2015 at 15:48 | comment | added | Douglas Zare | Do you mean the points are drawn from the interiors or from the boundaries? | |
| Nov 11, 2015 at 15:37 | answer | added | Joseph O'Rourke | timeline score: 2 | |
| Nov 11, 2015 at 14:19 | comment | added | Mudi | Yes Gerry, I want to compute average degree of nodes placed, roughly, in a grid where adjacency defined in terms of distance. Problem arises in sensor networks. | |
| Nov 11, 2015 at 12:05 | comment | added | Gerry Myerson | MO is for math research questions. Is there a research angle to this question? | |
| Nov 11, 2015 at 11:04 | history | asked | Mudi | CC BY-SA 3.0 |