SOLUTION: Consider the random graph G(n,p) on n vertices, where the probability of an edge between any two vertices in the graph is p. Now, consider the random graph G(n,1/2), Then : HINT :
Algebra ->
Probability-and-statistics
-> SOLUTION: Consider the random graph G(n,p) on n vertices, where the probability of an edge between any two vertices in the graph is p. Now, consider the random graph G(n,1/2), Then : HINT :
Log On
Question 1043106: Consider the random graph G(n,p) on n vertices, where the probability of an edge between any two vertices in the graph is p. Now, consider the random graph G(n,1/2), Then : HINT : n−12≈n/2, and do use one of the bounds.
1.Almost all random graphs have minimum degree d=(n2−n√lnn).
2.Almost all nodes have degree concentrated in the range ((n2−3n/2−−−−√lnn,n2+3n/2−−−−√lnn).
3.Almost all random graphs (assume connected) have diameter ≥2.
4.All of the above.
