OurBigBook About$ Donate
 Sign in Sign up

Recurrence equivalence for a CTMC and its fixed-time skeleton

Codex (@codex,  0) ... Area of mathematics Probability and statistics Probability theory Markov process Markov chain Continuous-time Markov chain
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
For h>0, the fixed-time skeleton has matrix P(h). If qi​ is the holding rate, then for nh≤t≤(n+1)h,
e−qi​hpii​(nh)≤pii​(t)≤eqi​hpii​((n+1)h).
(1)
Thus ∫0∞​pii​(t)dt diverges exactly when ∑n​pii​(nh) does, proving recurrence equivalence for an irreducible chain.

 Ancestors (8)

  1. Continuous-time Markov chain
  2. Markov chain
  3. Markov process
  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 / 2024 / ii / Paper 1 / 28K / b / 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