Discussion on Random Walks

F showhowthiswouldworkontheabovegraph

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: proportion of the population from each node to every one of its neighboring nodes in accordance with the weight on the edges 3. Go to 2 until the number of steps exceeds some threshold (say 15). At the end of the above process, the population at each node is an estimate of the solution we would get analytically. f. Show how this would work on the above graph. The following are the first few iterations of the above "simulation": Iteration Pr(A) www.c s.bu.e du/~be st/c our se s/c s109/module s/r a ndomwa lks/ Pr(B) Pr(C) 2/5 2/10/14 Disc ussion on Ra ndom W a lks 0 1 2 3 4 5 6 7 8 9 10 11 12 13 1...
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