Tail estimates for sums of variables sampled by a random walk

Combinatorics Probability and Computing

Volumn 17, Issue 2, 2008, Pages 307-316

  Wagner, Roy ^a,b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; ASYMPTOTIC ANALYSIS; GRAPH THEORY;

ASYMPTOTIC INFORMATION; GAUSSIAN VARIABLES; RANDOM WALK;

MARKOV PROCESSES;

EID: 39449095401     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008772     Document Type: Article

References (8)

1. Artstein-Avidan, S. and Milman, V. (2006) Logarithmic reduction of the level of randomness in some probabilistic geometric constructions. J. Funct. Anal. 235 297-329.
2. Bennett, G. (1962) Probability inequalities for the sum of independent random variables. J. Amer. Statist. Assoc. 57 33-45.
3. Dinwoodie, I. H. (1995) A probability inequality for the occupation measure of a reversible Markov chain. Ann. Appl. Probab. 5 37-43.
4. Gillman, D. (1998) A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27 1203-1220.
5. Hoory, S., Linial, N. and Wigderson, A. (2006) Expander graphs and their applications. Bulletin of the AMS 43 439-561.
6. Kargin, V. (2007) A large deviation inequality for vector functions on finite reversible Markov Chains (2007). Ann. Appl. Probab. 17(4) 1202-1221.
7. Leon, C. A. and Perron, F. (2004) Optimal Hoeffding bounds for discrete reversible Markov chains. Ann. Appl. Probab. 14 958-970.
8. Lezaud, P. (1998) Chernoff type bound for finite Markov chains. Ann. Appl. Probab. 8 849-867.