Definitions

# Alignments of random points

Statistics shows that if you put a large number of random points on a bounded flat surface you can find many alignments of random points. Some people think that this can be used to prove that ley lines exist due to chance alone (as opposed to supernatural or anthropological explanations).

One precise definition which expresses the generally accepted meaning of "alignment" as:

a set of points, chosen from a given set of landmark points, all of which lie within at least one straight path of a given width w

"Straight path of width w" may be defined as the set of all points within a distance of w/2 of a straight line on a plane, or a great circle on a sphere, or in general any geodesic on any other kind of manifold. Note that, in general, any given set of points that are aligned in this way will contain an uncountable number of infinitesimally different straight paths. Therefore, only the existence of at least one straight path is necessary to determine whether a set of points is an alignment. For this reason, it is easier to count the sets of points, rather than the paths themselves.

The width w is important: it allows the fact that real-world features are not mathematical points, and that their positions need not line up exactly for them to be considered in alignment.

For example, using a 1 mm pencil line to draw alignments on an 1:50,000 Ordnance Survey map, a suitable value of w would be 50 m.

## An estimate of the probability of alignments existing by chance

Statistically, finding alignments on a landscape gets progressively easier as the geographic area to be considered increases. One way of understanding this phenomenon is to see that the increase in the number of possible combinations of sets of points in that area overwhelms the decrease in the probability that any given set of points in that area line up.

The number of alignments found is very sensitive to the allowed width w, increasing approximately proportionately to wk-2, where k is the number of points in an alignment.

For those interested in the mathematics, the following is a very approximate order-of-magnitude estimate of the likelihood of alignments, assuming a plane covered with uniformly distributed "significant" points.

Consider a set of n points in a compact area with approximate diameter d and area approximately d². Consider a valid line to be one where every point is within distance w/2 of the line (that is, lies on a track of width w, where w << d).

Consider all the unordered sets of k points from the n points, of which there are

$frac \left\{n!\right\} \left\{\left(n-k\right)!k!\right\}.$

What is the probability that any given set of points is collinear in this way? Let us very roughly consider the line between the "leftmost" and "rightmost" two points of the k selected points (for some arbitrary left/right axis: we can choose top and bottom for the exceptional vertical case). These two points are by definition on this line. For each of the remaining k-2 points, the probability that the point is "near enough" to the line is roughly w/d, which can be seen by considering the ratio of the area of the line tolerance zone (roughly wd) and the overall area (roughly d²).

So, the expected number of k-point alignments, by this definition, is very roughly

$frac \left\{n!\right\} \left\{\left(n-k\right)!k!\right\} left\left(\left\{frac\left\{w\right\}\left\{d\right\}\right\}right\right)^\left\{k-2\right\}.$

For n >> k this is approximately

$frac \left\{n^k\right\} \left\{k!\right\} left\left(\left\{frac\left\{w\right\}\left\{d\right\}\right\}right\right)^\left\{k-2\right\}.$

Now assume that area is equal to $d^2$, and say there is a density α of points such that $n = alpha d^2$.

Then we have the expected number of lines equal to:

$frac \left\{alpha^k d^\left\{2k\right\}\right\} \left\{k!\right\} left\left(\left\{frac\left\{w\right\}\left\{d\right\}\right\} right\right)^\left\{k-2\right\}$

and an area density of k-point lines of:

$frac 1 \left\{d^2\right\} frac \left\{alpha^k d^\left\{2k\right\}\right\} \left\{k!\right\} left\left(\left\{frac\left\{w\right\}\left\{d\right\}\right\} right\right)^\left\{k-2\right\}.$

Gathering the terms in k we have an areal density of k-point lines of:

$d^k frac \left\{alpha^k\right\} \left\{k!\right\} w^\left\{k-2\right\}.$

Thus, contrary to intuition, the number of k-point lines expected from random chance increases much more than linearly with the size of the area considered.

## Computer simulation of alignments

607 4-point alignments of 269 random points

Computer simulations show that points on a plane tend to form alignments similar to those found by ley hunters in numbers consistent with the order-of-magnitude estimates above, suggesting that ley lines may also be generated by chance. This phenomenon occurs regardless of whether the points are generated pseudo-randomly by computer, or from data sets of mundane features such as pizza restaurants.

It is easy to find alignments of 4 to 8 points in reasonably small data sets with w = 50 m. Choosing large areas or larger values of w makes it easy to find alignments of 20 or more points.