Conditions for recurrence and transience of a Markov chain on Z^ + and estimation of a geometric success probability.
From MaRDI portal
Publication:1848972
Recommendations
- Eaton's Markov chain, its conjugate partner and \(\mathcal P\)-admissibility
- scientific article; zbMATH DE number 3852161
- Admissibility in quadratically regular problems and recurrence of symmetric Markov chains: Why the connection?
- When is Eaton's Markov chain irreducible?
- Markov chain conditions for admissibility in estimation problems with quadratic loss
Cites work
- scientific article; zbMATH DE number 3163289 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 48363 (Why is no real title available?)
- scientific article; zbMATH DE number 1418385 (Why is no real title available?)
- A simple criterion for transience of a reversible Markov chain
- A statistical diptych: Admissible inferences -- recurrence of symmetric Markov chains
- Admissibility in quadratically regular problems and recurrence of symmetric Markov chains: Why the connection?
- Criteria for the recurrence or transience of stochastic process. I
- Eaton's Markov chain, its conjugate partner and \(\mathcal P\)-admissibility
- Recurrent networks and a theorem of Nash-Williams
Cited in
(4)- When is Eaton's Markov chain irreducible?
- Evaluating default priors with a generalization of Eaton's Markov chain
- Recurrence and transience of a Markov chain on \(\mathbb{Z}^+\) and evaluation of prior distributions for a Poisson mean
- Stability of the tail Markov chain and the evaluation of improper priors for an exponential rate parameter
This page was built for publication: Conditions for recurrence and transience of a Markov chain on \(\mathbb Z^ +\) and estimation of a geometric success probability.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848972)