\begin{thebibliography}{10}

\bibitem{alon2004probabilistic}
N.~Alon and J.~H. Spencer.
\newblock {\em The probabilistic method}.
\newblock John Wiley \& Sons, 3rd edition, 2007.

\bibitem{Appel2002}
M.~J.~B. Appel and R.~P. Russo.
\newblock {The connectivity of a graph on uniform points on $[0,1]^d$}.
\newblock {\em Statistics \& Probability Letters}, 60(4):351--357, 2002.

\bibitem{balister2008percolation}
P.~Balister, A.~Sarkar, and B.~Bollob{\'a}s.
\newblock Percolation, connectivity, coverage and colouring of random geometric
  graphs.
\newblock In {\em Handbook of Large-Scale Random Networks}, pages 117--142.
  Springer, 2008.

\bibitem{bollobas2001random}
B.~Bollob{\'a}s.
\newblock {\em Random graphs}.
\newblock Cambridge University Press, 2001.

\bibitem{Bollobas1987}
B.~Bollob{\'{a}}s and A.~Thomason.
\newblock Threshold functions.
\newblock {\em Combinatorica}, 7(1):35--38, 1987.

\bibitem{Bourgain1998}
J.~Bourgain and G.~Kalai.
\newblock Threshold intervals under group symmetries.
\newblock {\em Convex Geometric Analysis MSRI Publications Volume 34}, pages
  59--63, 1998.

\bibitem{Bradonjic2014}
M.~Bradonji\'{c} and W.~Perkins.
\newblock On sharp thresholds in random geometric graphs.
\newblock In {\em Approximation, Randomization, and Combinatorial Optimization.
  Algorithms and Techniques, {APPROX/RANDOM}}, pages 500--514, 2014.

\bibitem{erd6s1960evolution}
P.~Erd\"{o}s and A.~R{\'e}nyi.
\newblock On the evolution of random graphs.
\newblock {\em Publ. Math. Inst. Hungar. Acad. Sci}, 5:17--61, 1960.

\bibitem{friedgut1996every}
E.~Friedgut and G.~Kalai.
\newblock Every monotone graph property has a sharp threshold.
\newblock {\em Proceedings of the American Mathematical Society},
  124(10):2993--3002, 1996.

\bibitem{gilbert1959random}
E.~Gilbert.
\newblock Random graphs.
\newblock {\em The Annals of Mathematical Statistics}, pages 1141--1144, 1959.

\bibitem{gilbert1961random}
E.~Gilbert.
\newblock Random plane networks.
\newblock {\em Journal of the Society for Industrial \& Applied Mathematics},
  9(4):533--543, 1961.

\bibitem{Godehardt1996}
E.~Godehardt and J.~Jaworski.
\newblock On the connectivity of a random interval graph.
\newblock {\em Random Struct. Algorithms}, 9(1-2):137--161, 1996.

\bibitem{goel2004sharp}
A.~Goel, S.~Rai, and B.~Krishnamachari.
\newblock Sharp thresholds for monotone properties in random geometric graphs.
\newblock In {\em Proceedings of STOC}, pages 580--586. ACM, 2004.

\bibitem{Gupta1998}
P.~Gupta and P.~R. Kumar.
\newblock Critical power for asymptotic connectivity in wireless networks.
\newblock In {\em Stochastic Analysis, Control, Optimization and Applications},
  pages 547--566, 1998.

\bibitem{hall1985coverage}
P.~Hall.
\newblock On the coverage of $ k $-dimensional space by $ k $-dimensional
  spheres.
\newblock {\em The Annals of Probability}, 13(3):991--1002, 1985.

\bibitem{janson1986random}
S.~Janson.
\newblock Random coverings in several dimensions.
\newblock {\em Acta Mathematica}, 156(1):83--118, 1986.

\bibitem{Krishnamachari2002}
B.~Krishnamachari, S.~B. Wicker, R.~B\'{e}jar, and M.~Pearlman.
\newblock Critical density thresholds in distributed wireless networks.
\newblock In {\em Communications, information and network security}, 2002.

\bibitem{Mccolm2001}
G.~L. Mccolm.
\newblock Threshold functions for random graphs on a line segment.
\newblock {\em Combinatorics, Probability and Computing}, 13:373--387, 2001.

\bibitem{Panchapakesan2001}
P.~Panchapakesan and D.~Manjunath.
\newblock On the transmission range in dense ad hoc radio networks.
\newblock In {\em Proceedings of IEEE Signal Processing Communication (SPCOM)},
  2001.

\bibitem{penrose1997longest}
M.~D. Penrose.
\newblock The longest edge of the random minimal spanning tree.
\newblock {\em The annals of applied probability}, pages 340--361, 1997.

\bibitem{Penrose1999}
M.~D. Penrose.
\newblock On $k$-connectivity for a geometric random graph.
\newblock {\em Random Struct. Algorithms}, 15(2):145--164, 1999.

\bibitem{penrose2003random}
M.~D. Penrose.
\newblock {\em Random geometric graphs}, volume~5.
\newblock Oxford University Press Oxford, 2003.

\bibitem{spencer1987ten}
J.~H. Spencer.
\newblock {\em Ten lectures on the probabilistic method}, volume~52.
\newblock SIAM, 1987.

\end{thebibliography}