Hi, I have questions.

I need your help.

Thanks.

A graph consists of a set of vertices V and a set of edges E which connect the vertices together. Suppose we create a random graph (known as the ErdosRenyi random graph) as follows. Start with n vertices 121, . . . ,1)\". and then for each (i,j), 1 S '2', 7 j S n connect (196; '03-) with probability p indepedently for each 133'. Calculate the pmf of a. The number of edges. b. The degree of a vertex, where the degree means the number of edges incident to a vertex