Pages that link to "Item:Q1345578"
From MaRDI portal
The following pages link to Computable bounds for geometric convergence rates of Markov chains (Q1345578):
Displaying 50 items.
- Law of large numbers for random dynamical systems (Q267734) (← links)
- Retracted: Fixed point theorems and explicit estimates for convergence rates of continuous time Markov chains (Q288125) (← links)
- Stability of noisy Metropolis-Hastings (Q341137) (← links)
- Geometric ergodicity for classes of homogeneous Markov chains (Q404128) (← links)
- A uniform Berry-Esseen theorem on \(M\)-estimators for geometrically ergodic Markov chains (Q418248) (← links)
- New average optimality conditions for semi-Markov decision processes in Borel spaces (Q438786) (← links)
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains (Q614121) (← links)
- Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations (Q619769) (← links)
- On nonlinear Markov chain Monte Carlo (Q638765) (← links)
- The design and analysis of a generalized RESTART/DPR algorithm for rare event simulation (Q666351) (← links)
- Faithful couplings of Markov chains: Now equals forever (Q678615) (← links)
- Attack allocation on remote state estimation in multi-systems: structural results and asymptotic solution (Q680517) (← links)
- Stochastic games with unbounded payoffs: applications to robust control in economics (Q692089) (← links)
- On adaptive Markov chain Monte Carlo algorithms (Q817970) (← links)
- On the asymptotic behavior of an Ornstein-Uhlenbeck process with random forcing (Q818630) (← links)
- On the optimality equation for average cost Markov control processes with Feller transition probabilities (Q819727) (← links)
- Abstraction-guided truncations for stationary distributions of Markov population models (Q832087) (← links)
- An extension of the square root law of TCP (Q839875) (← links)
- Lower estimates of transition densities and bounds on exponential ergodicity for stochastic PDEs (Q850975) (← links)
- On the ergodicity properties of some adaptive MCMC algorithms (Q862214) (← links)
- Optimality in Feller semi-Markov control processes (Q867940) (← links)
- Approximation of noncooperative semi-Markov games (Q868575) (← links)
- Markov chain Monte Carlo: can we trust the third significant figure? (Q900463) (← links)
- On a continuous solution to the Bellman-Poisson equation in stochastic games (Q983723) (← links)
- Zero-sum ergodic semi-Markov games with weakly continuous transition probabilities (Q1028603) (← links)
- Expectations for nonreversible Markov chains (Q1270857) (← links)
- What do we know about the Metropolis algorithm? (Q1273859) (← links)
- Two convergence properties of hybrid samplers (Q1296738) (← links)
- Information bounds for Gibbs samplers (Q1307091) (← links)
- Rates of convergence for everywhere-positive Markov chains (Q1347202) (← links)
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo. (Q1431211) (← links)
- Bounds on regeneration times and convergence rates for Markov chains (Q1593619) (← links)
- Geometric ergodicity of Metropolis algorithms (Q1613599) (← links)
- Asymptotically optimal pointwise and minimax quickest change-point detection for dependent data (Q1744230) (← links)
- Convergence rates for semistochastic processes (Q1756980) (← links)
- One-shot coupling for certain stochastic recursive sequences. (Q1766079) (← links)
- Multiscale expansion of invariant measures for SPDEs (Q1766913) (← links)
- Quantitative bounds on convergence of time-inhomogeneous Markov chains (Q1769405) (← links)
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains (Q1774194) (← links)
- Nonparametric estimation in null recurrent time series. (Q1848865) (← links)
- Spectral theory and limit theorems for geometrically ergodic Markov processes (Q1872341) (← links)
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). (Q1877387) (← links)
- A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling. (Q1879910) (← links)
- Sufficient burn-in for Gibbs samplers for a hierarchical random effects model. (Q1879955) (← links)
- Markov chain convergence: From finite to infinite (Q1915845) (← links)
- Rates of convergence of the Hastings and Metropolis algorithms (Q1922398) (← links)
- Geometric ergodicity and the spectral gap of non-reversible Markov chains (Q1930854) (← links)
- Stochastic approximation cut algorithm for inference in modularized Bayesian models (Q2066747) (← links)
- Fundamental design principles for reinforcement learning algorithms (Q2094028) (← links)
- Wasserstein-based methods for convergence complexity analysis of MCMC with applications (Q2117437) (← links)
