Threshold conjecture for monotone properties of random geometric graphs

Let $G_d(n,p)$ be the random geometric graph model, and let $\mathcal{F}$ be a non-trivial monotone graph property, where monotonicity means monotonicity under adding edges. Random geometric graph threshold conjecture. Every non-trivial monotone property has a threshold in $G_d(n,p)$. The analogous general theorem for $G(n,p)$ is known, and special cases are known for $d=1$; the general statement for random geometric graphs remains open.