Abstract
The behavior of the random graph G(n,p) around the critical probability pc = $ {1 \over n} $ is well understood. When p = (1 + O(n1-3))pc the components are roughly of size n2-3 and converge, when ...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have