A Problem in Last-Passage Percolation
Abstract
Let \X(v), v ∈ Zd × Z+\ be an i.i.d. family of random variables such that P\X(v)= eb\=1-P\X(v)= 1\ = p for some b>0. We consider paths π ⊂ Zd × Z+ starting at the origin and with the last coordinate increasing along the path, and of length n. Define for such paths W(π) = number of vertices πi, 1 i n, withX(πi) = eb. Finally let Nn() = number of paths π of length n starting at π0 = 0 and with W(π) n. We establish several properties of n ∞ [Nn]1/n.
0
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.