Unformatted text preview: number on the die is 1. Alternatively, write a program to connect each pair of nodes with probability p = 1 / 6. Describe the graph you obtained. Is it connected or not? What is the average degree and the degree distribution? Are there any cycles? (b) Now connect node pairs if the number is 1 or 2; alternatively, change the probability in your program to p = 1 / 3. How is the graph di²erent from the previous case? (c) Extra credit question: How many edges do you expect a graph with N nodes will have if they are accepted by throwing with a die (in other words, they are accepted with probability p = 1 / 6)? (d) Extra credit question: for the graph in point c, what is your expectation for the shape of the curve determined by the degree distribution when N is large? E.g. will it be decreasing, increasing, have a peak, have a valley? 1...
View
Full Document
 Fall '09
 Graph Theory, Work, extra credit question

Click to edit the document details