Multiple geodesics with the same direction

David Coupier (Laboratoire Paul Painlevé, UMR 8524, Université Lille 1)

Abstract


The directed last-passage percolation (LPP) model with independent exponential times is considered. We complete the study of asymptotic directions of infinite geodesics, started by Ferrari and Pimentel [5]. In particular, using a recent result of [3] and a local modification argument, we prove there is no (random) direction with more than two geodesics with probability 1.

Full Text: Download PDF | View PDF online (requires PDF plugin)

Pages: 517-527

Publication Date: September 26, 2011

DOI: 10.1214/ECP.v16-1656

References

  1. K.S. Alexander. Percolation and minimal spanning forests in infinite graphs. Ann. Probab. 23 (1995), no. 1, 87--104. MR1330762 (96c:60114)
  2. F. Baccelli and C. Bordenave. The radial spanning tree of a Poisson point process. Ann. Appl. Probab. 17 (2007), no. 1, 305--359. MR2292589 (2008a:60025)
  3. D. Coupier and P. Heinrich. Coexistence probability in the last passage percolation model is 6-8\log2. arXiv:1007.0652 (2010)
  4. D. Coupier and V.C. Tran. The Directed Spanning Forest is almost surely a tree. arXiv:1010.0773v2 (2010)
  5. P.A. Ferrari and L.P.R. Pimentel. Competition interfaces and second class particles. Ann. Probab. 33 (2005), no. 4, 1235--1254. MR2150188 (2006e:60141)
  6. C. Hoffman. Geodesics in first passage percolation. Ann. Appl. Probab. 18 (2008), no. 5, 1944--1969. MR2462555 (2010c:60295)
  7. C.D. Howard and C.M. Newman. Geodesics and spanning trees for Euclidean first-passage percolation. Ann. Probab. 29 (2001), no. 2, 577--623. MR1849171 (2002f:60189)
  8. J.B. Martin. Last-passage percolation with general weight distribution. Markov Process. Related Fields 12 (2006), no. 2, 273--299. MR2249632 (2008b:60216)
  9. J.B. Martin. Private communication (2011).
  10. H. Rost. Nonequilibrium behaviour of a many particle process: density profile and local equilibria. Z. Wahrsch. Verw. Gebiete 58 (1981), no. 1, 41--53. MR0635270 (83a:60176)


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.