Question: We still consider an Erdos-Renyi graph. A triangle in the graph consists of a triple of edges {i, j}, {j, k}, {k, i } with


We still consider an Erdos-Renyi graph. A triangle in the graph consists of a triple of edges {i, j}, {j, k}, {k, i } with if k f i. (a) Find the expected number of triangles in the graph. (b) Extra credit: Find an expression for the variance of the number of triangles in the graph
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
