Greedy lattice paths with general weights
Abstract
Let \Xv:v∈Zd\ be i.i.d. random variables. Let S(π)=Σv∈πXv be the weight of a self-avoiding lattice path π. Let \[Mn=\S(π):π has length n and starts from the origin\.\] We are interested in the asymptotics of Mn as n∞. This model is closely related to the first passage percolation when the weights \Xv:v∈Zd\ are non-positive and it is closely related to the last passage percolation when the weights \Xv,v∈Zd\ 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 ∃α>0, E(X0+)d(+X0+)d+α<+∞ and that E[X0-]<+∞, we prove that there exists a finite real number M such that Mn/n converges to a deterministic constant M in L1 as n tends to infinity. And under the stronger assumptions that ∃α>0, E(X0+)d(+X0+)d+α<+∞ and that E[(X0-)4]<+∞, we prove that Mn/n converges to the same constant M almost surely as n tends to infinity.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.