Quantitative bounds on convergence of time-inhomogeneous Markov chains

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/105051604000000620 in the Annals of Applied Probability (http://www.imstat.org/aap/) by

Scientific paper

10.1214/105051604000000620

Convergence rates of Markov chains have been widely studied in recent years. In particular, quantitative bounds on convergence rates have been studied in various forms by Meyn and Tweedie [Ann. Appl. Probab. 4 (1994) 981-1101], Rosenthal [J. Amer. Statist. Assoc. 90 (1995) 558-566], Roberts and Tweedie [Stochastic Process. Appl. 80 (1999) 211-229], Jones and Hobert [Statist. Sci. 16 (2001) 312-334] and Fort [Ph.D. thesis (2001) Univ. Paris VI]. In this paper, we extend a result of Rosenthal [J. Amer. Statist. Assoc. 90 (1995) 558-566] that concerns quantitative convergence rates for time-homogeneous Markov chains. Our extension allows us to consider f-total variation distance (instead of total variation) and time-inhomogeneous Markov chains. We apply our results to simulated annealing.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantitative bounds on convergence of time-inhomogeneous Markov chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantitative bounds on convergence of time-inhomogeneous Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantitative bounds on convergence of time-inhomogeneous Markov chains will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-586952

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.