Optimal reward on a sparse tree with random edge weights

DOI10.1239/JAP/1067436091MaRDI QIDQ4819506zbMATH OpenOpenAlexFDO

Authors Thomas M. Lewis, D. Khoshnevisan

Publication date 27 September 2004

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1239/jap/1067436091

zbMATH Keywords

tree-indexed random walkoptimal rewardlogarithmic dimension

Mathematics Subject Classification ID

Trees (05C05) Sums of independent random variables; random walks (60G50)

Recommendations

• Searches on a Binary Tree with Random Edge-Weights
• On weighted heights of random trees
• The maximum of a tree-indexed random walk in the big jump domain
• scientific article; zbMATH DE number 1123792
• Once edge-reinforced random walk on a tree

Cites work

• scientific article; zbMATH DE number 3538576 (Why is no real title available?)
• scientific article; zbMATH DE number 1158743 (Why is no real title available?)
• scientific article; zbMATH DE number 1418385 (Why is no real title available?)
• scientific article; zbMATH DE number 3320009 (Why is no real title available?)
• A new proof of the Hartman-Wintner law of the iterated logarithm
• Association of Random Variables, with Applications
• Chernoff's theorem in the branching random walk
• Fast graphs for the random walker
• Greedy Search on the Binary Tree with Random Edge-Weights
• Postulates for subadditive processes
• Random walk in a random environment and first-passage percolation on trees
• Some results on the cluster set \(C(\{S_n/a_n\})\) and the LIL
• The first birth problem for an age-dependent branching process
• Tree-indexed random walks on groups and first passage percolation

This page was built for publication: Optimal reward on a sparse tree with random edge weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819506)