Go to PageRank. After 'setup' with 1 random surfer you'll see a small network. By clicking on the 'step' button, you will be calculating the PageRank of each node. It will take several iterations for the algorithm to converge. At each iteration, the probability that a random walker is found at any given node A is proportional to the probability that it was on a node B with a directed edge to A, divided by the outdegree of node B. The edge width in the visualization is proportional to the probability that a node transitions from B to A.
PageRank (2 points)
Construct a small directed network (about 10 nodes) in GDF or .net format and load it into GUESS. Construct it such that you have at least one node that will have low indegree but high PageRank
g.nodes.pagerank. Color by PageRank
g.nodes.indegree. Size the nodes by indegree
resizeLinear(indegree,minsize,maxsize)(you are choosing minsize and maxsize). Turn in an image of your network.
Open the Preferential Attachment: Click on 'setup' to start out with a cycle of 2 vertices. Click on 'go-once' to add vertices one by one, each with 1 edge.
Go to Small Worlds. This is a NetLogo model that will allow you to vary the rewiring probability.
Submission of your homework is via WebCampus. You must submit all the required files in a single pdf document containing all the answers.
Acknowledgement: The assignment is modified from Lada Adamic.