Long-range last-passage percolation on the line (Q2443191)

Let \(G=(\mathbb{Z}, E)\) be a random graph, where every directed edge \((i,j)\) from vertex \(i\) to vertex \(j>i\) is present independently with probability \(p\in (0,1]\). In the paper the authors consider a model in which weights \(v_{i,j}\) are attached to all edges \((i,j)\in E\). The paper is devoted to study the asymptotic behavior of the random variable \(w_{0,n}\), which is the maximum weight of all directed paths from 0 to \(n\), as \(n\to \infty\). The results of the paper are split into two cases: the first case, where the weights have a second moment and the second case, where they do not. For the first case, the strong law of large numbers and a functional central limit theorem for the random variable \(w_{0,n}\) are proved. Moreover, scaling laws for the length of the longest edge and the weight of the heaviest edge used on the maximizing path from 0 to \(n\) are described. For the second case (the second moment is infinite), scaling laws are obtained and asymptotic distributions are expressed in terms of a ``continuous last-passage percolation'' model on \([0,1]\).