Memoryless routing in convex subdivisions: Random walks are optimal.

Dan Chen Luc Devroye Vida Dujmovic Pat Morin

Published in: Comput. Geom. (2012)

Keyphrases

random walk
directed graph
markov chain
transition probabilities
link prediction
piecewise linear
dynamic programming
stationary distribution
email
routing protocol
convex optimization
web graph
transition probability matrix
markov random walk