In a graph, each edge is replaced by two arrows, one in each direction. They are labeled by the corresponding transition probabilities.

Converting a normal graph into the Markov chain which defines our random walk. All green arrows have transition probability ?/?, and all purple arrows have probability ?/?.

David is a final year PhD student at UCL studying geometric group theory. When not doing maths he can usually be found singing or playing the flute.

More from Chalkdust

Both comments and trackbacks are currently closed.