ASYMPTOTICS OF FIRST-PASSAGE PERCOLATION ON ONE-DIMENSIONAL GRAPHS

摘要

In this paper we consider first-passage percolation on certain one-dimensional periodic graphs, such as the Z x {0, 1, ..., K - 1}(d-1) nearest neighbour graph for d, K >= 1. We expose a regenerative structure within the first-passage process, and use this structure to show that both length and weight of minimal-weight paths present a typical one-dimensional asymptotic behaviour. Apart from a strong law of large numbers, we derive a central limit theorem, a law of the iterated logarithm, and a Donsker theorem for these quantities. In addition, we prove that the mean and variance of the length and weight of minimizing paths are monotone in the distance between their end-points, and further show how the regenerative idea can be used to couple two first-passage processes to eventually coincide. Using this coupling we derive a 0-1 law.