  We find large deviation principles for the degree distribution and the
proportion of isolated vertices for the near intermediate random geometric
graph models on n vertices placed uniformly in [0, 1]^d, for d in N. In the
course of the proof of these large deviation results we find joint large
deviation principle for the empirical locality measure of the coloured random
geometric graphs,(Canning & Penman, 2003).
