pith. sign in

arxiv: 1703.04008 · v2 · pith:7RKDX477new · submitted 2017-03-11 · 🧮 math.NA · cs.NA· math.PR

Numerical simulation of polynomial-speed convergence phenomenon

classification 🧮 math.NA cs.NAmath.PR
keywords polynomialmixingnumericalresultsconvergencedifficultexpectedhybrid
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.