Boundedness of discounted tree sums
Abstract
Let (V(u),\, u∈ T) be a (supercritical) branching random walk and (ηu,\,u∈ T) be marks on the vertices of the tree, distributed in an i.i.d.\ fashion. Following Aldous and Bandyopadhyay AB05, for each infinite ray of the tree, we associate the discounted tree sum D() which is the sum of the e-V(u)ηu taken along the ray. The paper deals with the finiteness of D(). To this end, we study the extreme behaviour of the local time processes of the paths (V(u),\,u∈ ). It answers a question of Nicolas Curien, and partially solves Open Problem 31 of Aldous and Bandyopadhyay AB05. We also present several open questions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.