scientific article
From MaRDI portal
Publication:3828838
zbMath0674.60067MaRDI QIDQ3828838
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Limit theorems in probability theory (60F99)
Related Items (20)
Uniform Markov renewal theory and ruin probabilities in Markov random walks. ⋮ Partial mixing and Edgeworth expansion ⋮ Regeneration-based bootstrap for Markov chains ⋮ A note on asymptotic expansions for Markov chains using operator theory ⋮ Refined large deviation asymptotics for the classical occupancy problem ⋮ Validity of the formal Edgeworth expansion when the underlying distribution is partly discrete ⋮ A uniform Berry-Esseen theorem on \(M\)-estimators for geometrically ergodic Markov chains ⋮ On Edgeworth expansions for dependency-neighborhoods chain structures and Stein's method ⋮ Sharp asymptotics of large deviations for general state-space Markov-additive chains in \(\mathbb{R}^d\) ⋮ Edgeworth expansion for ergodic diffusions ⋮ Small time Edgeworth-type expansions for weakly convergent nonhomogeneous Markov chains ⋮ A note on asymptotic expansions for sums over a weakly dependent random field with application to the Poisson and Strauss processes ⋮ A renewal approach to Markovian \(U\)-statistics ⋮ The Nagaev-Guivarc’h method via the Keller-Liverani theorem ⋮ Asymptotic behavior for Markovian iterated function systems ⋮ Sharp connections between Berry-Esseen characteristics and Edgeworth expansions for stationary processes ⋮ Saddlepoint expansions for sums of Markov dependent variables on a continuous state space ⋮ The Berry-Esseen bound for general Markov chains ⋮ Parametric first-order Edgeworth expansion for Markov additive functionals. Application to \(M\)-estimations ⋮ Asymptotic expansions in sequential estimation for the first-order random coefficient autoregressive model: Regenerative approach
This page was built for publication: