Cut-off for n-tuples of exponentially converging processes

Stochastic Processes and their Applications

Volumn 116, Issue 10, 2006, Pages 1433-1446

  Barrera, Javiera ^b   Lachaud, Béatrice ^b   Ycart, Bernard ^a  

^a LMC   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Chi square distance; Cut off; Exponential convergence; Hellinger distance; Kullback distance; Total variation distance

Indexed keywords

DISTANCE MEASUREMENT; ESTIMATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; STOCHASTIC PROGRAMMING;

CHI SQUARE DISTANCE; CUT OFF; EXPONENTIAL CONVERGENCE; HELLINGER DISTANCE; KULLBACK DISTANCE; TOTAL VARIATION DISTANCE;

CONVERGENCE OF NUMERICAL METHODS;

EID: 33748128012     PISSN: 03044149     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.spa.2006.03.003     Document Type: Article

References (24)

1. Aldous D., and Diaconis P. Shuffling cards and stopping times. Amer. Math. Monthly 93 5 (1986) 333-348
2. Aldous D., and Diaconis P. Strong uniform times and finite random walks. Adv. Appl. Math. 8 (1987) 69-97
3. Bhat U.N. Elements of Applied Stochastic Processes (1972), John Wiley & Sons Inc., New York
4. Bon J.-L., and Pǎltǎnea E. Convergence of the number of failed components in a Markov system with nonidentical components. J. Appl. Probab. 38 4 (2001) 882-897
5. Diaconis P. The cut-off phenomenon in finite Markov chains. Proc. Natl. Acad. Sci. USA 93 4 (1996) 1659-1664
6. Diaconis P., Graham R.L., and Morrison J.A. Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Structures Algorithms 1 1 (1990) 51-72
7. P. Diaconis, L. Saloff-Coste, Separation cut-offs for Birth and Death chains model, Tech. Rep. 2005-14. Dept. of Statistics, Stanford Univ., 2005
8. Diaconis P., and Shahshahani M. Time to reach stationarity in the Bernoulli-Laplace diffusion model. SIAM J. Math. Anal. 18 1 (1987) 208-218
9. Feller W. An Introduction to Probability Theory and its Applications. Vol. I. 3rd edn (1968), John Wiley & Sons Inc., New York
10. Feller W. An Introduction to Probability Theory and its Applications. Vol. II. 2nd edn (1971), John Wiley & Sons Inc., New York
11. Gibbs A., and Su F. On choosing and bounding probability metrics. Internat. Statist. Rev. 70 3 (2002) 419-435
12. Lachaud B. Cut-off and hitting times for a sample of Ornstein-Uhlenbeck processes and its average. J. Appl. Probab. 42 4 (2005) 1069-1080
13. Martínez S., and Ycart B. Decay rates and cut-off for convergence and hitting times of Markov chains with countably infinite state space. Adv. in Appl. Probab. 33 1 (2001) 188-205
14. Pollard D. A User's Guide to Measure Theoretic Probability (2001), Cambridge University Press
15. Porod U. The cut-off phenomenon for random reflections. Ann. Probab. 24 1 (1996) 74-96
16. Reiss R.-D. Approximate Distributions of Order Statistics. Springer Series in Statistics (1989), Springer-Verlag, New York
17. Rosenthal J.S. On generalizing the cut-off phenomenon for random walks on groups. Adv. Appl. Math. 16 3 (1995) 306-320
18. Saloff-Coste L. Lectures on finite Markov chains. Lectures on Probability Theory and Statistics (Saint-Flour, 1996). Lecture Notes in Math. vol. 1665 (1997), Springer, Berlin 301-413
19. Saloff-Coste L. Random walks on finite groups. Probability on Discrete Structures. Encyclopaedia Math. Sci. vol. 110 (2004), Springer, Berlin 263-346
20. Shiryaev A.N. Probability. Graduate Texts in Math. vol. 95 (1996), Springer-Verlag, New York
21. F. Su, Methods for quantifying rates of convergence for random walks on groups, Ph.D. Thesis, Harvard University, 1995
22. Ycart B. Cutoff for Markov chains: some examples and applications. Complex Systems (Santiago, 1998). Nonlinear Phenom. Complex Systems vol. 6 (2001), Kluwer Acad. Publ., Dordrecht 261-300
23. Ycart B. Cutoff for samples of Markov chains. ESAIM Probab. Stat. 3 (1999) 89-106 (electronic)
24. Ycart B. Stopping tests for Markov chain Monte-Carlo methods. Methodol. Comput. Appl. Probab. 2 1 (2000) 23-36