Optimal reward on a sparse tree with random edge weights
From MaRDI portal
Publication:4819506
DOI10.1239/jap/1067436091zbMath1049.60039MaRDI QIDQ4819506
Thomas M. Lewis, Davar 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the Hartman-Wintner law of the iterated logarithm
- Random walk in a random environment and first-passage percolation on trees
- Postulates for subadditive processes
- The first birth problem for an age-dependent branching process
- Tree-indexed random walks on groups and first passage percolation
- Some results on the cluster set \(C(\{S_n/a_n\})\) and the LIL
- Fast graphs for the random walker
- Chernoff's theorem in the branching random walk
- Greedy Search on the Binary Tree with Random Edge-Weights
- Association of Random Variables, with Applications