Markov chain sensitivity measured by mean first passage times (Q1587271): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q126550574, #quickstatements; #temporary_batch_1721910495864
 
Property / Wikidata QID
 
Property / Wikidata QID: Q126550574 / rank
 
Normal rank

Latest revision as of 13:30, 25 July 2024

scientific article
Language Label Description Also known as
English
Markov chain sensitivity measured by mean first passage times
scientific article

    Statements

    Markov chain sensitivity measured by mean first passage times (English)
    0 references
    0 references
    0 references
    10 January 2001
    0 references
    For an \(n\)-state time-homogeneous irreducible Markov chain with transition matrix \(P\) and stationary distribution \(\pi^T= \{\pi_j\}^n_{j=1}\), if \(M_{ij}\) denotes the mean first passage time from state \(i\) to state \(j\), then, as is well known, \(M_{jj}= 1/\pi_j\). If \(\widetilde P= P-E\) is the transition matrix of a similar chain, of which the stationary distribution is \(\widetilde\pi^T= \{\widetilde\pi_j\}^n_{j=1}\), the authors show that \(\pi^{-1}_j|\pi_j- \widetilde\pi_n|\leq{1\over 2}\|E\|_\infty\max_{i\neq j} M_{ij}\). This bound, in focussing on relative local perturbation in \(\pi_j\), complements bounds of global character such as those of the reviewer on \(\|\pi-\widetilde\pi\|_1\) using an ergodicity coefficient in the condition number. Reference to the reviewer's [24], listed as ``to appear'', has appeared in [Stat. Probab. Lett. 17, No. 2, 163-168 (1993; Zbl 0777.60065)]. The mean first passage matrix would seem to be expensive to compute from a practical point of view.
    0 references
    0 references
    stationary probabilities
    0 references
    relative bounds on local perturbation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers