Timeline for A point process for modeling location of trees in an infinite forest?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2011 at 16:17 | vote | accept | Scott Armstrong | ||
| Jan 7, 2011 at 0:03 | answer | added | Carl Feynman | timeline score: 3 | |
| Jan 6, 2011 at 20:29 | comment | added | Scott Armstrong | By thinking through Anthony's example, I realized I need the probability of finding a large ball with no points to actually be zero. So I have edited the question according-- sorry for moving the goal posts on you. | |
| Jan 6, 2011 at 20:26 | history | edited | Scott Armstrong | CC BY-SA 2.5 |
added 13 characters in body
|
| Jan 6, 2011 at 19:57 | comment | added | Joseph O'Rourke | It might help to look at the discussion of homogeneous Poisson point processes by Béla Bollobás and Oliver Riordan in their book Percolation (p.241), which you can access through Google books. Not certain if this will help meet your criteria... | |
| Jan 6, 2011 at 19:52 | comment | added | Anthony Quas | What about taking a Poisson process (with intensity 1 say) and deleting any point whose nearest neighbour is at a distance less than 1/4 say. In this way you delete pi/16 proportion of points (in the plane - it gets better in higher dimensions). The minimum distance between points is 1/4. In any disc of size 10/4 the probability that the original Poisson process contains a point is very high. It must still be true for the thinned Process (but I haven't done the calculation). | |
| Jan 6, 2011 at 19:28 | history | asked | Scott Armstrong | CC BY-SA 2.5 |