I want to test the hypothesis that a group of vectors in 3D space, say given by a long list of xyz coordinates from some experiment, have no preferred direction. Is it sufficient to pick some direction in space, say the x-axis, and calculate the cosine angle between each data vector and this direction, and look at the mean cosine angle? Thanks, -nuun
-
$\begingroup$ I cannot imagine that is the right way to do it, but it has been decades since I had a statistics class. For this kind of very specific question, I think you will have a better experience at stats.stackexchange.com/questions although, for the moment, their site is not coming up. $\endgroup$– Will JagyCommented Aug 27, 2011 at 4:17
4 Answers
I presume that by "having no preferred direction" you mean that the distribution on the sphere is uniform - as it has just been pointed out by Gerry. Testing uniformity on the sphere is a classical statistical problem. There is A LOT about it: you may have a look at the book "Directional Statistics" by Mardia and Jupp (especially Chapters 9 and 10), or, for instance, at these more recent papers by Pycke and Bakshaev.
There is a notion of uniform distribution on spheres, and a notion of discrepancy on a sphere (which is a numerical measure of the distance from uniform distribution). That should give you some search terms. One paper on the topic (probably more theoretical than you want, but it should have or at least point to the relevant definitions) is Martin Blumlinger, Slice discrepancy and irregularities of distribution on spheres, Mathematika 38 (1991) 105-116.
Here is one approach to consider.
Treating the data as points on the surface of the unit sphere, consider the collection of convex subsets on this surface that contain all of your observations. Then, define $S$ to be minimum area among such sets. One way to interpret the idea of "having no preferred direction" is that this set $S$ should be almost as big as the entire surface; conversely a preferred direction would manifest as the data being tightly concentrated in a small area on the sphere.
This is just a rough idea -- figuring out how to operationalize "almost as big as the entire surface" would depend on your statistical needs. Hope I haven't missed the mark too badly.
-
$\begingroup$ That's a decent idea, I think. But what if there are several preferred directions? $\endgroup$– NuunCommented Aug 27, 2011 at 6:09
-
$\begingroup$ Yeah, in that case you'd need to cluster the observations in some way first, so the relevant area would be over disjoint convex covering regions. But the basic idea of comparing the containing area to the total possible area still stands I would think. There are surely lots of (different) ways to do (basically) what you want -- it all boils down to operationally defining "preferred direction". Good luck. $\endgroup$– R HahnCommented Aug 27, 2011 at 6:33
-
$\begingroup$ A set of pretty uniformly distributed points, and the same set with one point appearing a billion times, will get the same measure. Your test is valid, but it's power will be very low. $\endgroup$ Commented Oct 27, 2012 at 7:44
-
$\begingroup$ @Brendan, I guess as an applied statistician I'm usually happy to rule out the kind of degeneracy you mention, but your point is well taken. On a separate note, several years ago I used your nauty program when doing my masters degree on a branch-and-bound algorithm for the maximum independent set problem. So thanks for that! $\endgroup$– R HahnCommented Oct 27, 2012 at 15:37