A Problem in Last-Passage Percolation
Probability
2007-06-26 v1 Mathematical Physics
math.MP
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(\pi) = \text{number of vertices \pi_i, 1 \le i \le n, with}X(\pi_i) = e^b. Finally let N_n(\al) = \text{number of paths \pin\pi_0 = \bold 0W(\pi) \ge \al n.} We establish several properties of .
Cite
@article{arxiv.0706.3626,
title = {A Problem in Last-Passage Percolation},
author = {Harry Kesten and Vladas Sidoravicius},
journal= {arXiv preprint arXiv:0706.3626},
year = {2007}
}