paper

A Problem in Last-Passage Percolation

arXiv:0706.3626

Abstract

Let be an i.i.d. family of random variables such that for some . We consider paths starting at the origin and with the last coordinate increasing along the path, and of length . Define for such paths $W(π) = \text{number of vertices $π_i, 1 \le i \le n$, with}X(π_i) = e^b$. Finally let $N_n(\al) = \text{number of paths $πnπ_0 = \bold 0W(π) \ge \al n$.}$ We establish several properties of .

1 figure

A Problem in Last-Passage Percolation · wovepaper