Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
How do you show that the error is O(k^(-1/2))? Also, what happens if the degrees obey a power law, i.e., a few nodes have very high degree, but most nodes have low degree?
