Pages that link to "Item:Q1774194"
From MaRDI portal
The following pages link to Renewal theory and computable convergence rates for geometrically erdgodic Markov chains (Q1774194):
Displaying 50 items.
- Retracted: Fixed point theorems and explicit estimates for convergence rates of continuous time Markov chains (Q288125) (← links)
- A computable bound of the essential spectral radius of finite range metropolis-Hastings kernels (Q310632) (← links)
- Optimal scaling for the pseudo-marginal random walk Metropolis: insensitivity to the noise generating mechanism (Q340131) (← links)
- Geometric ergodicity for classes of homogeneous Markov chains (Q404128) (← links)
- A simple variance inequality for \(U\)-statistics of a Markov chain with applications (Q426715) (← links)
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels. II (Q442086) (← links)
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms (Q449997) (← links)
- Diffusion models and steady-state approximations for exponentially ergodic Markovian queues (Q473169) (← links)
- Markov chain Monte Carlo estimation of quantiles (Q485905) (← links)
- Quantitative non-geometric convergence bounds for independence samplers (Q539523) (← links)
- Kernel estimators of asymptotic variance for adaptive Markov chain Monte Carlo (Q548543) (← links)
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains (Q614121) (← links)
- Rigorous confidence bounds for MCMC under a geometric drift condition (Q617654) (← links)
- Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices (Q625800) (← links)
- On the ergodicity properties of some adaptive MCMC algorithms (Q862214) (← links)
- Some remarks on MCMC estimation of spectra of integral operators (Q888474) (← links)
- Gibbs sampling, exponential families and orthogonal polynomials (Q900452) (← links)
- Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials'' (Q900454) (← links)
- Bounds on coefficients of reciprocals of formal power series with rapidly decreasing coefficients (Q933851) (← links)
- Augmented truncation approximations of discrete-time Markov chains (Q974997) (← links)
- A cautionary tale on the efficiency of some adaptive Monte Carlo schemes (Q988756) (← links)
- Perturbation theory for Markov chains via Wasserstein distance (Q1708977) (← links)
- CLTs and asymptotic variance of time-sampled Markov chains (Q1945602) (← links)
- General Bernstein-like inequality for additive functionals of Markov chains (Q2042045) (← links)
- On the convergence complexity of Gibbs samplers for a family of simple Bayesian random effects models (Q2065471) (← links)
- (Non)-escape of mass and equidistribution for horospherical actions on trees (Q2069649) (← links)
- Convergence rate bounds for iterative random functions using one-shot coupling (Q2080345) (← links)
- Convergence rates in uniform ergodicity by hitting times and \(L^2\)-exponential convergence rates (Q2100013) (← links)
- Wasserstein-based methods for convergence complexity analysis of MCMC with applications (Q2117437) (← links)
- Dimension free convergence rates for Gibbs samplers for Bayesian linear mixed models (Q2132527) (← links)
- \(V\)-geometrical ergodicity of Markov kernels via finite-rank approximations (Q2183122) (← links)
- Optimal scaling of random-walk Metropolis algorithms on general target distributions (Q2196541) (← links)
- Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance (Q2196543) (← links)
- On the limitations of single-step drift and minorization in Markov chain convergence analysis (Q2240862) (← links)
- Pseudo conservation for partially fluid, partially lossy queueing systems (Q2283262) (← links)
- Hitting time and convergence rate bounds for symmetric Langevin diffusions (Q2283681) (← links)
- Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression (Q2313288) (← links)
- On estimation of expectation of simultaneous renewal time of time-inhomogeneous Markov chains using dominating sequence (Q2337820) (← links)
- Exponential convergence rates for stochastically ordered Markov processes under perturbation (Q2338184) (← links)
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms (Q2341639) (← links)
- Return probabilities for the reflected random walk on \(\mathbb N_0\) (Q2346979) (← links)
- T. E. Harris's contributions to recurrent Markov processes and stochastic flows (Q2431513) (← links)
- An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift (Q2433262) (← links)
- Approximating Markov chains and \(V\)-geometric ergodicity via weak perturbation theory (Q2434495) (← links)
- Nonasymptotic bounds on the estimation error of MCMC algorithms (Q2435233) (← links)
- A central limit theorem for adaptive and interacting Markov chains (Q2448700) (← links)
- Statistical estimation of a growth-fragmentation model observed on a genealogical tree (Q2515516) (← links)
- Exponential concentration inequalities for additive functionals of Markov chains (Q2786488) (← links)
- Spectral Analysis of Markov Kernels and Application to the Convergence Rate Of Discrete Random Walks (Q2939265) (← links)
- Quantitative Convergence Rates for Subgeometric Markov Chains (Q2949844) (← links)
