Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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.

share|improve this question
    
I've rephrased your title to simplify it a bit - see en.wikipedia.org/wiki/Random_geometric_graph . Feel free to revert it if I have misread your question. –  j.c. Feb 15 '12 at 16:04
    
@jc Thanks for the new title suggestion, I like it. –  EclipseInterlude Feb 15 '12 at 16:09
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.