Unformatted text preview: Albert model, which one has a larger degree range? 2. Construct a graph with eight nodes and twelve edges (you can do it randomly or select an example that seems interesting). (a) Propose a node measure (or combination of measures) that can serve as a proxy for the severity of the e±ect of the nodes’s removal on the connectivity of the network. Order the nodes by this measure from highest expected e±ect to lowest. (Hypothetical example: the lower the clustering coeFcient of the node, the higher the e±ect of its removal.) (b) ²or each node, determine what is the e±ect of its removal on the size of the remaining largest connected component, the diameter of the largest connected component, and a third measure of your choosing. Order the nodes based on these three measures from highest e±ect to lowest. Do the results match your expectations from part (a)? 1...
View
Full Document
 Fall '09
 Graph Theory, Work, Smallworld network, average clustering coeﬃcient, Barab´sia Albert model

Click to edit the document details