| New Reply |
Connecting N points pairwise in volume V, average density of lines? |
Share Thread | Thread Tools |
| Aug26-12, 06:00 PM | #1 |
|
|
Connecting N points pairwise in volume V, average density of lines?
Say we take N random points in a volume V and connect the points pairwise with line-segments. I would like to estimate the number of segments that intersect some small volume v, and where N is large enough so that any small random sample volume v will have many intersections. Little volume v may or may not enclose any points.
Does this get me close? First let us estimate the total length of the line segments, Ʃ. Use an average separation distance D between each pair of points. The distance D is of order one half the length of the volume V, V = L^3, D = L/2. The total number of segments is N(N-1)/2 so an estimate for the length of line-segments, Ʃ = D*N(N-1)/2 for large N this is about D*N^2/2 Ʃ ≈ D*N^2/2 Assume this total length is evenly divided into each small volume v. The length in volume v is the fraction [d^3/D^3] times Ʃ, [d^3/D^3]*Ʃ = [d^3/D^3]*D*N^2/2 = σ Assume the average length of the line-segments that intersect the little volume v is one-half the length the little volume v, d/2. Then the average number of line-segments in v, ω, is, ω = σ/[d/2] = {[d^3/D^3]*D*N^2/2}/[d/2] = d^2*N^2/D^2 using Wolfram calculator, http://www.wolframalpha.com/ Using our Universe as an example, let d = 1m, N = 10^80, D = [3.5*10^80m^3]^.3333 ≈ 7*10^26 ω = 2*10^106 segments intersecting a volume of 1m^3. We can ask what must the size of the volume v above be so that on average there will be only one line-segment intersecting it. Set ω = 1 = d^2*N^2/D^2 now d is unknown and we use N and D above, d = D/N = 7*10^26/10^80 = 7*10^-54m. If we are too near a point this estimate is bad. If we enclose a point ω jumps by about N We can also ask how many points must a volume v have so that ω above changes significantly because of the additional line-segments from the enclosed points. I made many bad estimates but I think I'm within a factor of a billion above? Thanks for any help! |
| Aug29-12, 06:59 AM | #2 |
|
|
This is an interesting problem! I wonder, are the endpoints important, or do they just serve as a way of defining some random lines? Would it serve your purpose equally well to have some number of lines (the infinite kind) randomly distributed throughout your space?
|
| Aug29-12, 08:31 PM | #3 |
|
|
After some thought I realized that for N random points in a box that the density of line segments would fall off near the inside boundary of the box. Things could be more uniform in some closed space like S^3 but then a pair of points in S^3 gives two (or more) geodesic paths between the points? Maybe you include both paths? So do you think I'm in the ballpark with those numbers? |
| New Reply |
| Thread Tools | |
Similar Threads for: Connecting N points pairwise in volume V, average density of lines?
|
||||
| Thread | Forum | Replies | ||
| Connecting two points in the Universe? | Astrophysics | 6 | ||
| Mathematica Connecting Plot Points | Math & Science Software | 2 | ||
| what is meant by pairwise different points? | General Math | 2 | ||
| Points, Lines, and Planes in 3D Space! Given 3 points find a plane... | Calculus & Beyond Homework | 10 | ||
| Gauss's law, determing average volume charge density | Introductory Physics Homework | 1 | ||