In this paper we estimate the expectation of the size of the largest component in a supercritical random geometric graph; the expectation tends to a polynomial on a rate of exponential decay. We sharpen the expectation's asymptotic result using the central limit theorem. Similar results can be obtained for the size of the biggest open cluster, and for the number of open clusters of percolation on a box, and so on.
"The asymptotic size of the largest component in random geometric graphs with some applications." Adv. in Appl. Probab. 46 (2) 307 - 324, June 2014. https://doi.org/10.1239/aap/1401369696