A comparison of the 2pcf as measured by the ConKer algorithm versus existing clustering algorithms. Top: 2pcf monopole computed using ConKer with three different values of grid spacing g_S = 8 (grey), 4 (blue), 2 (red) h⁻¹ Mpc, and results from Cuesta et al. (2016) (purple line). Finer grids were resampled to ∆s = 8 h⁻¹ Mpc bins. The error bars on the ConKer points were extracted from the covariance matrix of the Patchy mock ensemble. The errors in Cuesta et al. (2016; shaded region) are from an ensemble of quick particle mesh mocks (White et al. 2014). The 2pcf is multiplied by s² to emphasize features at large scales. The lower subpanel shows the residual between the two methods. Bottom: same as the top panel, but for the 2pcf quadrupole . Here, the 2pcf is multiplied by s instead of s² by convention.