For simple random walk on a finite connected loopless unweighted graph, start at and stop on first hitting . If
then and for the Graph Laplacian . The incoming-visit balance equation is for ; at the Laplacian value is because all its coordinates sum to zero. Thus is the voltage for unit current from to , and . In particular, the expected number of directed transitions before is .

Articles by others on the same topic (0)

There are currently no matching articles.