Pages that link to "Item:Q1877387"
From MaRDI portal
The following pages link to Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). (Q1877387):
Displaying 23 items.
- Gibbs/Metropolis algorithms on a convex polytope (Q455635) (← links)
- Three kinds of geometric convergence for Markov chains and the spectral gap property (Q638421) (← links)
- Geometric bounds for eigenvalues of Markov chains (Q808102) (← links)
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements (Q904703) (← links)
- A subexponential upper bound for entropy convergence of Markov chains with a spectral gap (Q1291154) (← links)
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (Q1296583) (← links)
- Computable bounds for geometric convergence rates of Markov chains (Q1345578) (← links)
- Rates of convergence for everywhere-positive Markov chains (Q1347202) (← links)
- Essential spectral radius for Markov semigroups. I: Discrete time case (Q1424402) (← links)
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo. (Q1431211) (← links)
- Markov chain decomposition for convergence rate analysis (Q1872401) (← links)
- Lower bounds on \(\| K^ n \|_{1\to \infty}\) for some contractions \(K\) of \(L^ 2 (\mu)\), with applications to Markov operators (Q1906497) (← links)
- Geometric ergodicity and the spectral gap of non-reversible Markov chains (Q1930854) (← links)
- Fast mixing of Metropolis-Hastings with unimodal targets (Q1990039) (← links)
- On the convergence time of some non-reversible Markov chain Monte Carlo methods (Q2218850) (← links)
- Consistent estimation of the spectrum of trace class data augmentation algorithms (Q2325394) (← links)
- Computable bounds of an \(\ell^2\)-spectral gap for discrete Markov chains with band transition matrices (Q2836244) (← links)
- A class of Markov chains with no spectral gap (Q2855909) (← links)
- Spectral Analysis of Markov Kernels and Application to the Convergence Rate Of Discrete Random Walks (Q2939265) (← links)
- (Q3072057) (← links)
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on R<sup><i>n</i></sup> (Q3147441) (← links)
- Conductance bounds on the <i>L</i><sup>2</sup> convergence rate of Metropolis algorithms on unbounded state spaces (Q4464174) (← links)
- Numerical Results for the Metropolis Algorithm (Q4828772) (← links)