Keep reading
You are hereTelling a real circle match from a lucky one
The shape of space · Reading path
Two circles on a random sky never look completely unrelated, and a search over many circles will always find some that look alike. A real match is one whose score beats the best score that the same search finds on skies with no topology at all. This chapter defines the score used since 1998, derives how widely it scatters for unrelated circles, shows how detector noise lowers a true match, and explains why the threshold has to come from simulated false pairs.
You should know the circle geometry from the previous chapter and what a mean, a variance and a Gaussian distribution are.
Sample the temperature at equally spaced points around each circle, on the first and on the second, with . Temperatures are measured from the sky average. Because we do not know where the matching point starts, compare the second circle rotated by samples:
Indices wrap around the circle. This is the statistic of Cornish, Spergel and Starkman. Three properties follow from , which is rearranged:
A search computes for every shift, every pair of circle centres and every radius it tries, and keeps the maximum. That maximum is what has to be judged.
Suppose the temperatures are independent Gaussian numbers with the same variance , the simplest model of two circles that have nothing to do with each other. Fix . Introduce
This is a rotation by 45 degrees in the plane of and , so and are again independent Gaussians with variance . In the new variables and . With and ,
and are independent chi-squared variables with degrees of freedom each. The ratio then follows a beta distribution with both parameters equal to , whose variance is . Therefore
Changing variables from to turns the beta density into a density proportional to , which is equation 6 of the 1998 paper.
Worked example. With , the standard deviation is . A value of is three standard deviations out, and a single unrelated pair rarely reaches it.
The derivation treats every sample as independent. On a real sky, neighbouring points share the same hot or cold spot, so the samples are correlated. Cornish, Spergel and Starkman noted that correlations move the centre of the distribution towards larger and widen it. A rough way to see it is an effective number of samples: the formula still holds with replaced by the number of independent spots around the circle.
The 1998 paper also estimates how many independent points a circle offers: roughly for a map with angular resolution . Small circles have fewer of them, so their null distribution is wider, and below some radius a true match can no longer be told from luck. That radius is the of the Planck analysis.
In the saved tutorial run for a box of side , 300 unrelated back-to-back pairs sampled at 64 points, with noise at half the signal level, scatter with a standard deviation of at a fixed shift. That is much wider than the independent-sample value . In the effective-number picture it corresponds to about independent samples.
Now let the circles be a true pair. Each carries the same signal plus independent detector noise: and , with signal variance and noise variance . For large , numerator and denominator approach their averages:
The cross terms vanish because signal and noise are independent. The ratio is
equation 5 of the 1998 paper. Equal signal and noise give . Noise at one fifth of the signal gives .
Worked example. The tutorial run with predicts . Its nine true pairs average at the correct shift. With the prediction is , and the nine pairs average .
A blind search does not know the right shift, centre or radius, so it reports the best score over all of them. Even unrelated circles then look good. In the tutorial run with noise at half the signal, the best shift for each of 300 unrelated pairs averages , and one percent of them exceed . The Lab's grey band shows the same effect: at each radius it is the best score among unrelated axes, 86 of them on the default sky.
The only fair threshold comes from running the full search on simulated skies that share the real map's resolution, noise and mask but have no topology. Planck did exactly that. It processed 300 Monte Carlo simulations of its maps in the same way as the data and set the false detection level so that fewer than 1 percent of simulations would yield a false event.
Compare the nine true pairs of the same run with that threshold. Their best scores lie between and , all above . With noise at twice the signal, the true pairs fall to between and while the one percent false level is , and only one of nine pairs clears it.
The microwave sky adds its own noise for this test. Part of the temperature pattern does not come from the gas density at last scattering but from the gas velocity and from changing gravitational potentials along the way. These parts differ between the two paths to the same point. The COMPACT preprint counts them as noise for the circle signal. Planck also searched polarization maps, which come mainly from the moment of last scattering.
For the first task: gives . One pair scatters around that value, because the signal variance along a single circle differs from the sky average. On the default sky the Lab reads about .
Sources: Cornish, Spergel and Starkman 1998, equations 4 to 6 and the effective sample count, Planck 2015 results XVIII, section 4.2 on the threshold from 300 simulations, Cornish et al. 2004, equation 1, weighting each Fourier mode by m, COMPACT collaboration preprint on Doppler and ISW noise.
Raise the noise until the true pair sinks into the chance band.
You are hereTelling a real circle match from a lucky one
The shape of space · Reading path