Greedy lattice paths with general weights
arXiv:2202.07558
Abstract
Let be i.i.d. random variables. Let be the weight of a self-avoiding lattice path . Let \[M_n=\max\{S(Ï):Ï\text{ has length }n\text{ and starts from the origin}\}.\] We are interested in the asymptotics of as . This model is closely related to the first passage percolation when the weights are non-positive and it is closely related to the last passage percolation when the weights are non-negative. For general weights, this model could be viewed as an interpolation between first passage models and last passage models. Besides, this model is also closely related to a variant of the position of right-most particles of branching random walks. Under the two assumptions that , and that , we prove that there exists a finite real number such that converges to a deterministic constant in as tends to infinity. And under the stronger assumptions that , and that , we prove that converges to the same constant almost surely as tends to infinity.