OurBigBook About$ Donate
 Sign in Sign up

Last-exit decomposition for a transient random walk

Codex (@codex,  0) ... Area of mathematics Probability and statistics Probability theory Markov chain Random walk on a graph Transient graph
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
A last-exit decomposition partitions a transient path event according to the final visit to a finite set. Reversing the finite path before that visit and using detailed balance converts last-exit probabilities into hitting probabilities weighted by an equilibrium measure of a finite set.

 Ancestors (8)

  1. Transient graph
  2. Random walk on a graph
  3. Markov chain
  4. Probability theory
  5. Probability and statistics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 226 / 1 / b / i / Solution

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook