Groups
Category
A random walk on a graph moves from a node to one of its neighbors chosen uniformly at random at each step.
Dynamic programming with expected value solves problems where each state transitions randomly and we seek the expected cost, time, or steps to reach a goal.