Applications of geometric bounds to the convergence rate of Markov chains on R^ n.
Let \(P\) be a transition probability kernel of a discrete-time Markov chain on \(\mathbb R^ {n}\) with an invariant probability measure \(\pi \). Suppose that \(P\) has the form \(P(x,dy) = \alpha (x)d\delta _ {x}(y) + p(x,y)\,dy\), \(\delta _ {x}\) being the point mass at \(x\), and that \(\pi \) has a density with respect to the Lebesgue measure. The kernel \(P\) defines a positivity preserving contraction on \(L^ 2(\pi )\), denoted again by \(P\). Assume that the Markov chain is reversible with respect to the measure \(\pi \), hence \(P\) is a self-adjoint operator on \(L^ 2(\pi )\). Set \(\lambda _ 0(P) = \inf \sigma (P_ {| \mathbf 1^ {\bot }})\), \(\lambda _ 1(P) = \sup \sigma (P_ {| \mathbf 1^ {\bot }})\) and \(\rho = \max ( | \lambda _ 0(P)| , | \lambda _ 1(0)| )\), where \(\sigma (B)\) denotes the spectrum of a linear operator \(B\). Define Cheeger's constant by \[ k = \inf _ {0<\pi (A)<1}\,{\int \mathbf 1_ {A}(x)P(x,\complement A) d\pi (x) \over \pi (A)\pi (\complement A)}. \] \textit{G. F. Lawler} and \textit{A. D. Sokal} [Trans. Am. Math. Soc. 309, No. 2, 557--580 (1988; Zbl 0716.60073)] proved that \(k^ 2/8 \leq 1-\lambda _ 1(P) \leq k\). It is well known that the spectral radius \(\varrho \) is closely related to the convergence rate to the invariant measure \(\pi \). A geometric argument is used to obtain lower bounds on \(\inf \sigma ((I-P)_ {| \mathbf 1^ \bot }) = 1-\lambda _ 1(P)\) and an upper bound on \(k\), consequently, to get bounds on \(\lambda _ 1(P)\) (and \(\rho \)). Moreover, results on comparison of spectral radii of two reversible Markov chains are proven and several examples are discussed in detail.
- Explicit bounds for geometric convergence of Markov chains
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on Rn
- Computable bounds for geometric convergence rates of Markov chains
- Convergence rates in geometric ergodicity for discrete-time Markov chains
- Geometric convergence rates for time-sampled Markov chains
- Geometric Convergence Rates for Stochastically Ordered Markov Chains
- A Markov chain on the symmetric group and Jack symmetric functions
- Accelerating Gaussian diffusions
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Approximating the Permanent
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Brownian motion and the fundamental frequency of a drum
- Comparing sweep strategies for stochastic relaxation
- Comparison theorems for reversible Markov chains
- Computable bounds for geometric convergence rates of Markov chains
- Diffusion of color in the simple exclusion process
- Geometric bounds for eigenvalues of Markov chains
- Geometric ergodicity and hybrid Markov chains
- scientific article; zbMATH DE number 3890132 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3574390 (Why is no real title available?)
- scientific article; zbMATH DE number 3622441 (Why is no real title available?)
- scientific article; zbMATH DE number 472921 (Why is no real title available?)
- scientific article; zbMATH DE number 472933 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Markov chain convergence: From finite to infinite
- Markov chains for exploring posterior distributions. (With discussion)
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- On rates of convergence of stochastic relaxation for Gaussian and non- Gaussian distributions
- On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
- Rates of convergence for everywhere-positive Markov chains
- Rates of convergence for Gibbs sampling for variance component models
- Sampling from log-concave distributions
- Sampling-Based Approaches to Calculating Marginal Densities
- Shift-coupling and convergence rates of ergodic averages
- A subexponential upper bound for entropy convergence of Markov chains with a spectral gap
- Computable bounds for geometric convergence rates of Markov chains
- Rates of convergence for everywhere-positive Markov chains
- Essential spectral radius for Markov semigroups. I: Discrete time case
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
- Markov chain decomposition for convergence rate analysis
- Lower bounds on \(\| K^ n \|_{1\to \infty}\) for some contractions \(K\) of \(L^ 2 (\mu)\), with applications to Markov operators
- Geometric ergodicity and the spectral gap of non-reversible Markov chains
- Fast mixing of Metropolis-Hastings with unimodal targets
- Geometric ergodicity in a weighted Sobolev space
- On the convergence time of some non-reversible Markov chain Monte Carlo methods
- Consistent estimation of the spectrum of trace class data augmentation algorithms
- Computable bounds of an ^2-spectral gap for discrete Markov chains with band transition matrices
- A class of Markov chains with no spectral gap
- Spectral analysis of Markov kernels and application to the convergence rate of discrete random walks
- scientific article; zbMATH DE number 5847038 (Why is no real title available?)
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on Rn
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces
- Gibbs/Metropolis algorithms on a convex polytope
- Numerical Results for the Metropolis Algorithm
- On spectral bounds for symmetric Markov chains with coarse Ricci curvature
- Distributions of values of indefinite forms and higher-order spectral estimates for finite Markov chains.
- Symmetry Analysis of Reversible Markov Chains
- Explicit bounds for spectral theory of geometrically ergodic Markov kernels and applications
- Three kinds of geometric convergence for Markov chains and the spectral gap property
- Nonstandard representation of the Dirichlet form and application to the comparison theorem
- Geometric bounds for eigenvalues of Markov chains
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements
This page was built for publication: Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877387)
