I place $N$ points on a circular plane of radius $R$, and draw edges to connect points that are less than or equal to some distance $D$ to form a set of graphs or cliques $G_i$. As a function of $N$, $R$, and $D$, what is the mean number of points, $m_k$, that participate in graphs with $k$ or fewer vertices?
To clarify, the $N$ points are randomly placed on the circular plane with uniform probability across its surface.
