Two-point concentration in random geometric graphs (Q2390151)

Consider a sequence of independent identically distributed random variables \(X_n\) for \(n=1,2,\dots\) with a bounded density function in \(d\)-dimensional Euclidean space. A geometric graph \(G_n\) is defined on the first \(n\) random variables as vertices with edges between variables that are closer than a specified positive radius \(r=r(n)\). For \(n r^d = o(\ln n)\) it is shown that the probability distributions of the clique number, of the chromatic number, and of other specified graph parameters all become concentrated on two consecutive integers as \(n\) tends to infinity.