Spectral analysis of Markov kernels and application to the convergence rate of discrete random walks
From MaRDI portal
Publication:2939265
Abstract: Let be a Markov chain on a measurable space with transition kernel and let . The Markov kernel is here considered as a linear bounded operator on the weighted-supremum space associated with . Then the combination of quasi-compactness arguments with precise analysis of eigen-elements of allows us to estimate the geometric rate of convergence of to its invariant probability measure in operator norm on . A general procedure to compute for discrete Markov random walks with identically distributed bounded increments is specified.
Recommendations
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Approximating Markov chains and \(V\)-geometric ergodicity via weak perturbation theory
- Computable bounds of an \(\ell^2\)-spectral gap for discrete Markov chains with band transition matrices
- Spectral gap and convergence rate for discrete-time Markov chains
- Spectral analysis of random walk operators on Euclidean space
Cites work
- scientific article; zbMATH DE number 1190399 (Why is no real title available?)
- Approximating Markov chains and \(V\)-geometric ergodicity via weak perturbation theory
- Bounds on regeneration times and convergence rates for Markov chains
- Computable bounds for geometric convergence rates of Markov chains
- Essential spectral radius for Markov semigroups. I: Discrete time case
- Geomatric ergodicity and quasi-stationarity in discrete-time birth-death processes
- Geometric Convergence Rates for Stochastically Ordered Markov Chains
- Geometric ergodicity and the spectral gap of non-reversible Markov chains
- Markov chain convergence: From finite to infinite
- Markov chains and stochastic stability
- Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
- On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
- Orthogonality and probability: beyond nearest neighbor transitions
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Spectral theory and limit theorems for geometrically ergodic Markov processes
- Sur un Theoreme Spectral et son Application aux Noyaux Lipchitziens
Cited in
(7)- Recurrence of multidimensional persistent random walks. Fourier and series criteria
- Computable bounds of an \(\ell^2\)-spectral gap for discrete Markov chains with band transition matrices
- Spectral analysis of random walk operators on Euclidean space
- Rate of convergence of Nummelin-type representation of the invariant distribution of a Markov chain via the residual kernel
- Explicit bounds for spectral theory of geometrically ergodic Markov kernels and applications
- Robustness of iterated function systems of Lipschitz maps
- Large deviations for vector-valued functionals of a Markov chain: Lower bounds
This page was built for publication: Spectral analysis of Markov kernels and application to the convergence rate of discrete random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939265)