# Consider the random graph G(n, p) with mean degree c. Show that in the limit of large n the…

Consider the random graph G(n, p) with mean degree c. Show that in the limit of large n the expected number of triangles in the network is 1/z c^3 This means that the number of triangles is constant, neither growing nor vanishing in the limit of large n. Show that the expected number of connected triples in the network (as defined on page 200) is 1/2 nc^2. Hence calculate the clustering coefficient C, as defined in Eq. (7.41), and confirm that it agrees for large n with the value given in Eq. (12.11). A very simple quantity to calculate for the Poisson random graph is the clustering coefficient. Recall that the clustering coefficient C is a measure of the transitivity in a network (Section 7.9) and is defined as the probability that two network neighbors of a vertex are also neighbors of each other. In a random graph the probability that any two vertices are neighbors is exactly the same- all such probabilities are equal to p = c/(n-1). Hence c = c/n-1. This is one of several respects in which the random graph differs sharply from most from real- world networks, many of which have quite high clustering coefficients-see Table 8.1-while Eq. (12.11) tends to zero in the limit n rightarrow infinity if the mean degree c stays fixed. This discrepancy is discussed further in Section 12.8. Yet another way to write the clustering coefficient would be to note that if we have a path of length two, uvw, then it is also true to say that vertices u and w have a common neighbor in v- they share a mutual acquaintance in social network terms. If the triad uvw is closed then u and w are themselves acquainted, so the clustering coefficient can be thought of also as the fraction of pairs of people with a common friend who are themselves friends or equivalently as the mean probability that two people with a common friend are themselves friends. This is perhaps the most common way of defining the clustering coefficient. In mathematical notation: C= (number of triangles) times 3/(number of connected triples) Here a “connected triple” means three vertices uvw with edges (u, v) and (v, w). (The edge (u, w) can be present or not.) The factor of three in the numerator arises because each triangle gets counted three times when we count the connected triples in the network. The triangle uvw for instance contains the triples uvw, vwu, and wuv. In the older social networks literature the clustering coefficient is sometimes referred to as the “fraction of transitive triples, ” which is a reference to this definition of the coefficient. The textbook is network: an introduction

## Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
\$26
The price is based on these factors:
Number of pages
Urgency
Basic features
• Free title page and bibliography
• Unlimited revisions
• Plagiarism-free guarantee
• Money-back guarantee
On-demand options
• Writer’s samples
• Part-by-part delivery
• Overnight delivery
• Copies of used sources
Paper format
• 275 words per page
• 12 pt Arial/Times New Roman
• Double line spacing
• Any citation style (APA, MLA, Chicago/Turabian, Harvard)

# Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

### Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

### Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

### Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.