Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T00:50:28.425Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal reward on a sparse tree with random edge weights

Part of: Graph theory Stochastic processes

Published online by Cambridge University Press:  14 July 2016

Davar Khoshnevisan  and
Thomas M. Lewis
Davar Khoshnevisan*
Affiliation:
University of Utah
Thomas M. Lewis*
Affiliation:
Furman University
*
∗ Postal address: Department of Mathematics, University of Utah, Salt Lake City, UT 84112–0090, USA.
∗∗ Postal address: Department of Mathematics, Furman University, Greenville, SC 29613, USA. Email address: tom.lewis@furman.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

It is well known that the maximal displacement of a random walk indexed by an m-ary tree with bounded independent and identically distributed edge weights can reliably yield much larger asymptotics than a classical random walk whose summands are drawn from the same distribution. We show that, if the edge weights are mean-zero, then nonclassical asymptotics arise even when the tree grows much more slowly than exponentially. Our conditions are stated in terms of a Minkowski-type logarithmic dimension of the boundary of the tree.

Keywords

Optimal rewardtree-indexed random walklogarithmic dimension

MSC classification

Primary: 60G50: Sums of independent random variables; random walks 05C05: Trees

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 40 , Issue 4 , September 2003 , pp. 926 - 945
Copyright
Copyright © Applied Probability Trust 2003 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Aldous, D. (1992). Greedy search on a tree with random edge-weights. Comb. Prob. Comput. 1, 281–293.Google Scholar
Benjamini, I., and Peres, Y. (1994). Tree-indexed random walks and first-passage percolation. Prob. Theory Relat. Fields 98, 91–112.Google Scholar
Biggins, J. D. (1977). Chernoff's theorem in the branching random walk. J. Appl. Prob. 14, 630–636.Google Scholar
Chung, K. L. (1974). A First Course in Probability Theory, 2nd edn. Academic Press, New York.Google Scholar
De Acosta, A. (1983). A new proof of the Hartman—Wintner law of the iterated logarithm. Ann. Prob. 11, 270–276.Google Scholar
De Acosta, A., and Kuelbs, J. (1981). Some results on the cluster set C({Sn/an}) and the LIL. Ann. Prob. 11, 102–122.Google Scholar
Dembo, A., and Zeitouni, O. (1998). Large Deviations Techniques and Applications, 2nd edn. Springer, Berlin.CrossRefGoogle Scholar
Dubins, L., and Freedman, D. (1967). Random distribution functions. In Proc. Fifth Berkeley Symp. Math. Statist. Prob., Vol. II, eds Le Cam, L. and Neyman, J., University of California Press, Berkeley, CA, pp. 183–214.Google Scholar
Esary, J. D., Proschan, F., and Walkup, D. W. (1967). Association of random variables, with applications Ann. Math. Statist. 38, 1466–1474.Google Scholar
Hammersley, J. M. (1974). Postulates for subadditive processes. Ann. Prob. 2, 652–680.Google Scholar
Kingman, J. F. C. (1975). The birth problem for an age-dependent branch process. Ann. Prob. 12, 341–345.Google Scholar
Lyons, R., and Pemantle, R. (1992). Random walks in a random environment and first-passage percolation on trees. Ann. Prob. 20, 125–136.Google Scholar
Peres, Y. (1999). Probability on trees: an introductory climb. In Lectures on Probability Theory and Statistics (Lecture Notes Math. 1717), ed. Bernard, P., Berlin, Springer, pp. 193–280.Google Scholar
Virág, B. (2002). Fast graphs for the random walker. Prob. Theory Relat. Fields 124, 50–74.Google Scholar