Key points are not available for this paper at this time.
We investigate the behavior of large connected components in the Random Connection Model in the subcritical regime with any bounded connection function. We show that the asymptotic size of the largest component restricted to a window is the log of the volume of that window. We adopt methods from the discrete setting, including a sharpness result.
Küpper et al. (Mon,) studied this question.