The bouncing-ray conjecture for tree-indexed random walks
The bouncing-ray conjecture for tree-indexed random walks
Consider a tree-indexed random walk on with increment distribution . A ray is an escaping ray if as , and a bouncing ray if
Bouncing-ray conjecture. If has mean zero and finite variance and almost surely has bouncing rays, then almost surely has escaping rays. This is presented as an open question about tree-indexed random walks; the source gives no general resolution.
Sources & referencesView supporting material
Primary source
Robin Pemantle, “Tree-indexed processes”, arXiv:math/0404100 (2004).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.