Discussion on Random Walks


Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: lity that they would be selected by the walker (i.e., the edges do not have to be equally likely selected). b. In general, we are interested in how a very large number of walkers (a population of walkers) would end up covering the various nodes in the graph. The particular question we want to answer is to figure out the proportion (percentage) of the population at each node after having the walkers roam the graph for a very long time. Thus, for a node X, we want to find Pr(X). c. Recall that one way to do this (as we have done in class) is to establish relationships between the proportion of the population at each node, noting that they must all add up to 100%....
View Full Document

This note was uploaded on 02/10/2014 for the course CS 109 taught by Professor Azerbestavros during the Spring '13 term at BU.

Ask a homework question - tutors are online