Numerical simulation of polynomial-speed convergence phenomenon
arXiv:1703.04008 · doi:10.1007/s10955-017-1877-9
Abstract
We provide a hybrid method that captures the polynomial speed of convergence and polynomial speed of mixing for Markov processes. The hybrid method that we introduce is based on the coupling technique and renewal theory. We propose to replace some estimates in classical results about the ergodicity of Markov processes by numerical simulations when the corresponding analytical proof is difficult. After that, all remaining conclusions can be derived from rigorous analysis. Then we apply our results to two 1D microscopic heat conduction models. The mixing rate of these two models are expected to be polynomial but very difficult to prove. In both examples, our numerical results match the expected polynomial mixing rate well.
References in corpus (7)
- Spectral gaps in Wasserstein distances and the 2D stochastic Navier--Stokes equations
- Quantitative bounds on convergence of time-inhomogeneous Markov chains
- Heat conduction and Fourier's law by consecutive local mixing and thermalization
- Non-equilibrium steady states for chains of four rotors
- Non-equilibrium steady state and subgeometric ergodicity for a chain of three coupled rotors
- A practical criterion for positivity of transition densities
- Reflections on Gibbs: From Statistical Physics to the Amistad