On a finite undirected graph, the reversal of a loop-erased random walk from to has the law of a loop-erased random walk from to . The uniform-spanning-tree path representation proves the identity.

Ancestors (10)

  1. Loop-erased random walk
  2. Random walk on a graph
  3. Random walk
  4. Markov chain
  5. Markov process
  6. Probability theory
  7. Probability and statistics
  8. Area of mathematics
  9. Mathematics
  10. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version