Mean distance between points of 2D array

In summary, the conversation discusses finding the mean distance between points in an N x N array and whether there is a formula to do so. It is suggested to calculate the distances for all possible pairs of points and divide by the total number of pairs. However, there is no known "equation" for finding the median distance. The conversation also delves into the distribution of distances and the complexity of the problem. Ultimately, it is mentioned that a closed form solution has been found for the continuous case and this problem is related to a massive MIMO investigation.
  • #1
cosmik debris
734
171
Say I have an N X N array of points, I would like a formula to give the mean distance between the points. There are lots of short distances but only two long ones (diagonal). There are plenty of algorithms to do this but I would like to work out a formula if there is one. Can someone point me in the right direction?

Thanks
 
Mathematics news on Phys.org
  • #2
You know how to find the distance between any two points right?
To get the mean distance, find the distances for every possible pair of points, add them up, and divide by the number of pairs.
 
  • #3
Yeah I know how to calculate the distances, and I meant median not mean.
 
  • #4
I that case you need to also rank the distances.
To my knowledge there is no "equation" that will do that.

The median is so that the number of data points above and below is the same.
 
  • #5
My initial thoughts:
Number of points will be N², so number of distances will be N²(N²-1)/2.
So if theses distances were sorted by length, the one you would be looking for would be near N²(N²-1)/4.
As it turns out, N²(N²-1)/4 is always an integer, so it will always be possible that to get the median, you will be averaging between two values.

The number of distances of value 1 will be: 2·N(N-1)
The number of distances of integer value M will be: 2·N(N-M)
The number of distances of √2 will be 2·(N-1)²

Skipping to infinity:
When N is very large, the median distance between a corner point and all other points would be the radius of an arc that divides the square into equal areas: √(2N/π)
In contrast, a point near the center would be half that: √(N/2π)

Don't have time for more thinking right now.

Nasty problem.
 
  • #6
Yes it's tricky. We managed to get a closed form solution for the continuous case and as it turns out it did give us an insight into our problem. In case you're interested; this is a massive MIMO investigation. We were trying to compare a linear array of antennas to a square array. It turns out that a linear array say 10m long is equivalent to a square array of about 6m X 6m, not really any improvement.
 

FAQ: Mean distance between points of 2D array

What is the meaning of "mean distance between points of 2D array"?

The mean distance between points of a 2D array refers to the average distance between all the points in the array. This is calculated by finding the distance between each pair of points and then taking the average of all these distances.

How is the mean distance between points of 2D array calculated?

The mean distance between points of a 2D array is calculated by finding the distance between each pair of points using a suitable distance metric (e.g. Euclidean distance) and then taking the average of all these distances. This can be done using mathematical formulas or algorithms.

What is the significance of calculating the mean distance between points of 2D array?

The mean distance between points of a 2D array can provide important information about the distribution of points in the array. It can help in understanding the overall spread or density of points and can also be used for clustering or pattern recognition tasks.

Can the mean distance between points of 2D array be used for higher dimensional arrays?

Yes, the concept of mean distance between points can be extended to higher dimensional arrays (e.g. 3D or nD arrays). However, the calculation process may become more complex as the number of dimensions increases.

How can the mean distance between points of 2D array be optimized?

The mean distance between points of a 2D array can be optimized by using efficient algorithms for distance calculation and by choosing an appropriate distance metric based on the data and task at hand. Additionally, techniques such as dimensionality reduction can also help in optimizing the mean distance between points.

Similar threads

Replies
8
Views
573
Replies
20
Views
2K
Replies
10
Views
484
Replies
8
Views
1K
Replies
2
Views
1K
Replies
3
Views
1K
Replies
1
Views
993
Back
Top