Correlation between degree of two vertices in a n-vertices graph

ppftw
Messages
2
Reaction score
0
Hi! I'm a bit stumped on this computer-science-related statistics (I think that's what it would fall under) problem. It's over here:

http://math.stackexchange.com/questions/796517/correlation-between-the-degree-of-two-vertices-in-an-undirected-graph/796526?noredirect=1#796526

It would be awesome if someone could modify the answer, confirm it, or suggest an alternative approach...
 
Last edited by a moderator:
Physics news on Phys.org
What is Var of Bin(n-1,p)?
The rest looks ok.
 
Oh, it should be (n-1)p(1-p). Thanks for catching that and your response.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top