Quasar Alignments - Derivation of Expectation

What follows is based on section 5.2 of the Ph.D. thesis “The Alignment and Clustering of Quasars”, by Glyn George (1983).


N points are distributed randomly over a field of area A.   Around any given point, one would expect to find, on average, in the distance range (x, x + dx), a number of other points, given by

2*pi*x*dx*(N-1)/A

  [annulus of thickness dx around a point]

The pivotal quasar forms one end of a candidate alignment.   Each of these 2*pi*dx*(N-1)/A other quasars, in turn, will form the other end of a candidate alignment of length x.   If an intermediate quasar falls within a distance pmax of the line joining the first two quasars, then it is in the acceptance zone shown here and the candidate alignment will be accepted.

  [acceptance rectangle defined by two points]

Having taken one point as the pivot and another as the far end of the alignment, there are (N – 2) quasars remaining in the field, each of which has an equal chance of falling in the acceptance zone.   Hence, in each acceptance zone, we expect to find, on average, a number of points given by

2*pmax*x*(N-2)/A

We expect the number of alignments of “tolerance” p < pmax and of span   d ∈ (x, x + dx)   around a given point to be

(2*pi*(N-1)*x*dx/A) 
 * (2*pmax*x*(N-2)/A)

Integrating over all values of the alignment span d up to dmax, we obtain the number of alignments expected around each point to be

4*pi*(N-1)*(N-2)*pmax*dmax^3*/(3*A^2)

Now we take each quasar in turn as the pivotal quasar and sum the expectations.   However, each distinct alignment will be counted twice:   once with the quasar at one end as the pivot, then again with the quasar at the other end as the pivot.   We must therefore divide this sum by 2 in order to give the total number of alignments of distinct triples of points expected, E[nP], in a field with periodic boundaries:

E[nP] = (2pi/3)(pmax*dmax^3 / A^2) 
 *N(N-1)(N-2)

For a square area of side L, this can be rewritten as

E[nP] = (2pi/3)*N(N-1)(N-2)*(pmax/L)(dmax/L)^3


Boundary Correction

Let us now determine the boundary correction for the L×L square, for which we assume dmax < L / 2 .

[square with border zones identified]  

The square divides into three obvious regions, (centre, edges and corners), whose extent varies with the alignment span x.

Elementary search annuli whose centres fall in region (1) will lie entirely within the square and will be unaffected by edge effects.   That is,

C1 = 1   and   A1 = (L – 2x)2,
where   Ai = the area of region (i)   and
Ci = the edge-effects correction factor for region (i).


In region (2), one of the four edges will cause some of the search area to be lost, as shown here.   s   is the distance from the centre of the search annulus to the nearest edge of the square and x is the inner radius of the annulus.   Let A(s) be the proportion of the search area remaining inside the field.   Then, using the notation in this figure,

s = x cos θ

Recalling that the search area is an elementary annulus, we have
A(s) = 1 - theta/pi

The probability of finding a randomly placed point in the range (s, s + ds), given that it is somewhere in (0, x), is

p(s) ds = ds/x = -sin theta d_theta

  [partial loss of search area over an edge of the square]

For a given span x, the mean proportion of area remaining in a search area placed at random in region (2) is

Integral {A(s) p(s)} ds
 = ... = 1 - 1/pi

Therefore, in region (2),

C2 = 1 - 1/pi
 and    A2 = 4x(L-2x)

In region (3), part of the elementary search area will be lost over two of the four edges.   s   is the distance from the centre of the search annulus to the nearer vertical edge of the square, t   is the distance from the centre of the search annulus to the nearer horizontal edge of the square and x is the inner radius of the annulus.   Let A(st) be the proportion of the search area remaining inside the field.   Then, using the notation in this figure,
          s = x cos θ
and
          t = x cos φ ,
which leads to

A(s, t) = ... = 3/4 - (theta+phi)/(2pi)

  [partial loss of search area 
 over two edges of the square
 at a corner]

The probability of finding a randomly placed point in the range s < X < s + ds ,   t < Y < t + dt , given that the point is somewhere in the range 0 < X, Y < x , is

p(s,t) ds dt = ds dt / x^2

For a given span x, the mean proportion of area remaining in a search area placed at random in region (3) is

Integral Integral {A(s,t) p(s,t)} ds dt
 = ... = 3/4 - 1/pi

Therefore, in region (3),

C3 = 3/4 - 1/pi
 and    A3 = 4x^2

Bringing the correction factors for the three regions together, we arrive at the overall correction factor   C(x)   for edge effects on an alignment of span x:

C(x) = (A1C1 + A2C2 + A3C3) / A = ...

Therefore

C(x) = 1 - (4/pi)(x/L) + (4/pi - 1)(x/L)^2


At the start of the derivation of E[nP], we replace
          # points in annulus = 2pi*x*(N-1)*dx / A
by
          # points in annulus = 2pi*x*(N-1)*C(x)*dx / A
With this amendment, we proceed as before, to obtain

[Integral expression for E[nF], 
    incorporating C(x) ]

Therefore

E[nF] = E[nP] * (1 - (3/pi)(d/L) + (3/5)(4/pi - 1)(d/L)^2)


For the standard 5°×5° field in the thesis, with   L = 5°,   dmax = 1°   and   pmax = 30" , we have

E[nP] = pi*N(N-1)(N-2)/112500

and

E[nF]   =   0.8156 × E[nP]   =   2.2775×10–5 N (N – 1) (N – 2)

In the thesis, these expressions were verified by Monte-Carlo simulations and by comparison with the few published works available at that time.


  [Return to thesis summary]
  [Return to your previous page]

Created 2003 08 02 and most recently modified 2003 08 03 by Dr. G.H. George