The Gilbert model of a random geometric graph is the following: place points at random in a (two-dimensional) square box and join two if they are within distance $r$ of each other. For any standard graph property (e.g. connectedness) we can ask whether the graph is likely to have this property. If the property is monotone we can view the model as a process where we place our points and then increase $r$ until the property appears. In this talk we consider the property that the graph has a Hamilton cycle. It is obvious that a necessary condition for the existence of a Hamilton cycle is that the graph be 2-connected. We prove that, for asymptotically almost all collections of points, this is a sufficient condition: that is, the smallest $r$ for which the graph has a Hamilton cycle is exactly the smallest $r$ for which the graph is 2-connected. This work is joint work with Jozsef Balogh and B\'ela Bollob\'as
