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 teaches and researches maths at King’s College London, with a focus on geometry. In his spare time he likes to make music and read poetry.

More from Chalkdust

Both comments and trackbacks are currently closed.