scholarly journals A counterexample to a conjecture of J. M. Hammersley and D. J. A. Welsh concerning first-passage percolation

1983 ◽  
Vol 15 (02) ◽  
pp. 465-467 ◽  
Author(s):  
J. Van Den Berg

Consider first-passage percolation on the square lattice. Hammersley and Welsh, who introduced the subject in 1965, conjectured that the expected minimum travel time from (0, 0) to (n, 0) along paths contained in the cylinderis always non-decreasing inn.However, when the bonds have time-coordinate 1 with probabilitypand 0 with probability 1 –p(0 <P< 1), then, forpsufficiently small, we get a counterexample.

1983 ◽  
Vol 15 (2) ◽  
pp. 465-467 ◽  
Author(s):  
J. Van Den Berg

Consider first-passage percolation on the square lattice. Hammersley and Welsh, who introduced the subject in 1965, conjectured that the expected minimum travel time from (0, 0) to (n, 0) along paths contained in the cylinder is always non-decreasing in n. However, when the bonds have time-coordinate 1 with probability p and 0 with probability 1 – p (0 < P < 1), then, for p sufficiently small, we get a counterexample.


1998 ◽  
Vol 7 (1) ◽  
pp. 11-15 ◽  
Author(s):  
SVEN ERICK ALM

Consider first-passage percolation on the square lattice. Welsh, who together with Hammersley introduced the subject in 1963, has formulated a problem about mean first-passage times, which, although seemingly simple, has not been proved in any non-trivial case. In this paper we give a general proof of Welsh's problem.


1981 ◽  
Vol 18 (4) ◽  
pp. 809-819 ◽  
Author(s):  
J. Theodore Cox ◽  
Harry Kesten

Let U be the distribution function of the non-negative passage time of an individual edge of the square lattice, and let a0n be the minimal passage time from (0, 0) to (n, 0). The process a0n/n converges in probability as n → ∞to a finite constant μ (U) called the time constant. It is proven that μ (Uk)→ μ(U) whenever Uk converges weakly to U.


1980 ◽  
Vol 12 (04) ◽  
pp. 848-863 ◽  
Author(s):  
Harry Kesten

Let U be the distribution function of the passage time of an individual bond of the square lattice, and let pT be the critical probability above which the expected size of the open component of the origin (in the usual bond percolation) is infinite. It is shown that if (∗)U(0–) = 0, U(0) &lt; pT , then there exist constants 0 &lt; a, C 1 &lt; ∞ such that a self-avoiding path of at least n steps starting at the origin and with passage time ≦ an} ≦ 2 exp (–C 1 n). From this it follows that under (∗) the time constant μ (U) of first-passage percolation is strictly positive and that for each c &gt; 0 lim sup (1/n)Nn (c) &lt;∞, where Nn (c) is the maximal number of steps in the paths starting at the origin with passage time at most cn.


1980 ◽  
Vol 17 (4) ◽  
pp. 968-978 ◽  
Author(s):  
John C. Wierman

A generalization of first-passage percolation theory proves that the fundamental convergence theorems hold provided only that the time coordinate distribution has a finite moment of a positive order. The existence of a time constant is proved by considering first-passage times between intervals of sites, rather than the usual point-to-point and point-to-line first-passage times. The basic limit theorems for the related stochastic processes follow easily by previous techniques. The time constant is evaluated as 0 when the atom at 0 of the time-coordinate distribution exceeds½.


1977 ◽  
Vol 9 (01) ◽  
pp. 38-54 ◽  
Author(s):  
R. T. Smythe ◽  
John C. Wierman

We consider several problems in the theory of first-passage percolation on the two-dimensional integer lattice. Our results include: (i) a mean ergodic theorem for the first-passage time from (0,0) to the line x = n; (ii) a proof that the time constant is zero when the atom at zero of the underlying distribution exceeds C, the critical percolation probability for the square lattice; (iii) a proof of the a.s. existence of routes for the unrestricted first-passage processes; (iv) a.s. and mean ergodic theorems for a class of reach processes; (v) continuity results for the time constant as a functional of the underlying distribution.


1980 ◽  
Vol 17 (04) ◽  
pp. 968-978 ◽  
Author(s):  
John C. Wierman

A generalization of first-passage percolation theory proves that the fundamental convergence theorems hold provided only that the time coordinate distribution has a finite moment of a positive order. The existence of a time constant is proved by considering first-passage times between intervals of sites, rather than the usual point-to-point and point-to-line first-passage times. The basic limit theorems for the related stochastic processes follow easily by previous techniques. The time constant is evaluated as 0 when the atom at 0 of the time-coordinate distribution exceeds½.


1981 ◽  
Vol 18 (04) ◽  
pp. 809-819
Author(s):  
J. Theodore Cox ◽  
Harry Kesten

Let U be the distribution function of the non-negative passage time of an individual edge of the square lattice, and let a0n be the minimal passage time from (0, 0) to (n, 0). The process a0n/n converges in probability as n → ∞to a finite constant μ (U) called the time constant. It is proven that μ (Uk )→ μ(U) whenever Uk converges weakly to U.


1977 ◽  
Vol 9 (2) ◽  
pp. 283-295 ◽  
Author(s):  
John C. Wierman

Several problems are considered in the theory of first-passage percolation on the two-dimensional integer lattice. The results include: (i) necessary and sufficient conditions for the existence of moments of first-passage times; (ii) determination of an upper bound for the time constant; (iii) an initial result concerning the maximum height of routes for first-passage times; (iv) ergodic theorems for a class of reach processes.


Sign in / Sign up

Export Citation Format

Share Document