MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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|cite|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

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.