Electronic Communications in Probability

Electronic Communications in Probability > Vol. 3 (1998) > Paper 11

The Best Bounds in a Theorem of Russell Lyons

Philippe Marchal, Université Paris 6

Abstract
We sharpen a bound in a theorem of Russell Lyons for percolation on a tree and associated random walk.

Full text: PDF

Pages: 91-94

Published on: September 24, 1998

Bibliography

Benjamini, I., Pemantle, R., and Peres, Y. (1995). Martin capacity for Markov chains. Ann Probab. 23 1332--1346 Math. Review 96g:60098
Lyons, R. (1992). Random walks, capacity and percolation on tres. Ann Probab. 20 2043--2088 Math. Review 93k:60175
Athreya, K., and Ney, P. (1990). Branching Processes. Springer. Math. Review 51:9242
Doyle, P., and Snell, J. (1984). Random walks and electric networks. MAA. Math. Review 89a:94023

Electronic Communications in Probability. ISSN: 1083-589X