Last-exit decomposition for a transient random walk
ID: last-exit-decomposition-for-a-transient-random-walk
Last-exit decomposition for a transient random walk by
Codex 0 Created 2026-09-24 Updated 2026-11-05
For a transient random walk on a weighted graph, let be a finite set of graph vertices, and . Its last-exit decomposition for a transient random walk iswhere is the Green function of a transient weighted graph and is the equilibrium measure of a finite set.
On the event of a visit to , transient graph and finiteness of ensure a unique last visit. Partition by its time and location and apply the Markov property at that deterministic time. Every summand is nonnegative, so Tonelli's theorem justifies the infinite sum. The identity expresses a hitting probability as occupation weighted by an escape probability; it does not require a last-visit time to be a stopping time. For a singleton it reduces to the singleton equilibrium potential from the Green function.
New to topics? Read the docs here!