L1 convergence for greedy lattice paths
L1 convergence for greedy lattice paths
Let be i.i.d. random variables, and let denote the maximum weight of a lattice path of length from the origin. Assume that there exists such that
and that
convergence conjecture. There exists a constant such that
The stated negative-tail integrability condition ensures that ; the conjectured convergence for greedy lattice paths is presented as an open problem requiring new ideas beyond the lattice-animal argument.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Yinshan Chang and Anqi Zheng, “Greedy lattice paths with general weights”, arXiv:2202.07558 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.