L1 convergence for greedy lattice paths
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.