Random walk on graphs On an undirected graph G: ■ Starting from vertex vo Repeat for a number of steps: Go to a random neighbor Simple but powerful.Random walk on graphs On an undirected graph G: ◼ Starting from vertex v0 ◼ Repeat for a number of steps: ❑ Go to a random neighbor. ◼ Simple but powerful