Probability to visit nodes in a random walk on graph
I have a finite undirected graph in which a node is marked as "start" and another is marked as "goal". An agent is initially placed at the start node and it navigates through the graph randomly, i.e. at each step it chooses uniformly at random a neighbor node and moves to it. When it reaches the goal node it stops. I am looking for an algorithm that, for each node, gives an indication about the probability that the agent visits it, while traveling from start to goal. Thank you. As is often the case with graphs, it's simply a matter of knowing an appropriate way to describe the problem. One way