Average number of steps on a graph from node A to node B.

136 Views Asked by At

For a given undirected graph, if you have a 'person' that is able to move randomly from node to node only along edges, and, at each node, for a given time-step, if that node has N edges, the person will have a probability of 1/N of moving along each edge connected to that node, what is the average number of time-steps for a path that starts at A and ends at B? Is there a formula for finding this based on the edges in the graph?