basant/basant/raw/4880-w1.wiki

12 lines
245 B
Plaintext

:uni:
= Lecture 1 =
= Lecture 2 =
G(n,p) -> graph of n nodes where each node is connected with probability p
some formulas about node degrees
on to degree distribution -> Pk: probability that a (uniformly) randomly chosen node has degree k