2.24 R : Simulate 50 steps of the random walk on the graph in Figure 2.1. Repeat the simulation 10 times. How many of your simulations end at vertex ? Compare with the exact long-term probability the walk visits .

here is figure 2.1

A graph is a set of vertices and a set of edges. Two vertices are neighbors if there is an edge joining them. The degree of vertex v is the number of neighbors of v. For the graph in Figure 2.1, deg(a) = 1 , deg(b) = deg(c) = deg(d) = 4, deg(e) = 3, and degf) = 2. a Figure 2.1 Graph on six vertices. A graph is a set of vertices and a set of edges. Two vertices are neighbors if there is an edge joining them. The degree of vertex v is the number of neighbors of v. For the graph in Figure 2.1, deg(a) = 1 , deg(b) = deg(c) = deg(d) = 4, deg(e) = 3, and degf) = 2. a Figure 2.1 Graph on six vertices