DEGREE DISTRIBUTION OF A RANDOM GRAPH N-1 P(k)= k p-p）N- 是 Select k probability of nodes from N-1 missing N-1-k probability of edges having k edges <k>=pN-1) o=p1-pW-1) As the network size increases,the distribution becomes increasingly narrow-we are increasingly confident that the degree of a node is in the vicinity of <k>. Network Science:Random GraphsDEGREE DISTRIBUTION OF A RANDOM GRAPH Network Science: Random Graphs As the network size increases, the distribution becomes increasingly narrow—we are increasingly confident that the degree of a node is in the vicinity of <k>. Select k nodes from N-1 probability of having k edges probability of missing N-1-k edges P(k) = N -1 k æ è ç ö ø ÷p k (1- p) (N -1)-k < k >= p(N -1) sk 2 = p(1- p)(N -1) sk < k > = 1- p p 1 (N -1) é ë ê ù û ú 1/ 2 » 1 (N -1) 1/ 2