Spectral Analysis of Markov Kernels and Application to the Convergence Rate Of Discrete Random Walks
From MaRDI portal
Publication:2939265
DOI10.1239/aap/1418396242zbMath1305.60060arXiv1312.1656OpenAlexW2963852885MaRDI QIDQ2939265
Publication date: 19 January 2015
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1656
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Linear operators defined by compactness properties (47B07)
Related Items (3)
Robustness of iterated function systems of Lipschitz maps ⋮ Explicit bounds for spectral theory of geometrically ergodic Markov kernels and applications ⋮ Recurrence of multidimensional persistent random walks. Fourier and series criteria
Cites Work
- Unnamed Item
- Markov chains and stochastic stability
- Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
- Orthogonality and probability: beyond nearest neighbor transitions
- Computable bounds for geometric convergence rates of Markov chains
- Essential spectral radius for Markov semigroups. I: Discrete time case
- Bounds on regeneration times and convergence rates for Markov chains
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Spectral theory and limit theorems for geometrically ergodic Markov processes
- Markov chain convergence: From finite to infinite
- Geometric ergodicity and the spectral gap of non-reversible Markov chains
- Approximating Markov chains and \(V\)-geometric ergodicity via weak perturbation theory
- On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
- Geometric Convergence Rates for Stochastically Ordered Markov Chains
- Geomatric ergodicity and quasi-stationarity in discrete-time birth-death processes
- Sur un Theoreme Spectral et son Application aux Noyaux Lipchitziens
This page was built for publication: Spectral Analysis of Markov Kernels and Application to the Convergence Rate Of Discrete Random Walks