Memoryless Routing in Convex Subdivisions: Random Walks are Optimal

Dan Chen Luc Devroye Vida Dujmovic Pat Morin

Published in: CoRR (2009)

Keyphrases

random walk
directed graph
piecewise linear
markov chain
dynamic programming
transition probabilities
stationary distribution
flow graph
optimal solution
link prediction
random walker
learning algorithm
social networks
transition probability matrix
markov random walk