Annals of Probability

Hammersley’s process with sources and sinks

Eric Cator and Piet Groeneboom

Full-text: Open access


We show that, for a stationary version of Hammersley’s process, with Poisson “sources” on the positive x-axis, and Poisson “sinks” on the positive y-axis, an isolated second-class particle, located at the origin at time zero, moves asymptotically, with probability 1, along the characteristic of a conservation equation for Hammersley’s process. This allows us to show that Hammersley’s process without sinks or sources, as defined by Aldous and Diaconis [Probab. Theory Related Fields 10 (1995) 199–213] converges locally in distribution to a Poisson process, a result first proved in Aldous and Diaconis (1995) by using the ergodic decomposition theorem and a construction of Hammersley’s process as a one-dimensional point process, developing as a function of (continuous) time on the whole real line. As a corollary we get the result that EL(t,t)/t converges to 2, as t→∞, where L(t,t) is the length of a longest North-East path from (0,0) to (t,t). The proofs of these facts need neither the ergodic decomposition theorem nor the subadditive ergodic theorem. We also prove a version of Burke’s theorem for the stationary process with sources and sinks and briefly discuss the relation of these results with the theory of longest increasing subsequences of random permutations.

Article information

Ann. Probab., Volume 33, Number 3 (2005), 879-903.

First available in Project Euclid: 6 May 2005

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60C05: Combinatorial probability 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]
Secondary: 60F05: Central limit and other weak theorems

Longest increasing subsequence Ulam’s problem Hammersley’s process local Poisson convergence totally asymmetric simple exclusion processes (TASEP) second-class particles Burke’s theorem


Cator, Eric; Groeneboom, Piet. Hammersley’s process with sources and sinks. Ann. Probab. 33 (2005), no. 3, 879--903. doi:10.1214/009117905000000053.

Export citation


  • Aldous, D. and Diaconis, P. (1995). Hammersley's interacting particle process and longest increasing subsequences. Probab. Theory Relatated Fields \bf103 199–213.
  • Aldous, D. and Diaconis, P. (1999). Longest increasing subsequences: From patience sorting to the Baik–Deift–Johansson theorem. Bull. Amer. Math. Soc. 36 413–432.
  • Baik, J. and Rains, E. (2000). Limiting distributions for a polynuclear growth model with external sources. J. Statist. Phys. \bf100 523–541.
  • Burke, P. J. (1956). The output of a queueing system. Oper. Res. \bf4 699–704.
  • Ferrari, P. A. (1992). Shocks in the Burgers equation and the asymmetric simple exclusion process. In Automata Networks, Dynamical Systems and Statistical Physics (E. Goles and S. Martinez, eds.) 25–64. Kluwer, Dordrecht.
  • Groeneboom, P. (2001). Ulam's problem and Hammersley's process. Ann. Probab. 29 683–690.
  • Groeneboom, P. (2002). Hydrodynamical methods for analyzing longest increasing subsequences. J. Comput. Appl. Math. 142 83–105.
  • Hammersley, J. M. (1972). A few seedlings of research. Proc. Sixth Berkeley Symp. Math. Statist. Probab. \bf1 345–394. Univ. California Press, Berkeley.
  • Kingman, J. F. C. (1973). Subadditive ergodic theory. Ann. Probab. \bf1 883–909.
  • Liggett, T. M. (1999). Stochastic Interacting Systems, Contact, Voter and Exclusion Processes. Springer, New York.
  • Logan, B. F. and Shepp, L. A. (1977). A variational problem for random Young tableaux. Adv. Math. \bf26 206–222.
  • O'Connell, N. and Yor, M. (2002). A representation for non-colliding random walks. Electron. Comm. Probab. \bf7 1–12.
  • Seppäläinen, T. (1996). A microscopic model for the Burgers equation and longest increasing subsequences. Electron. J. Probab. 1 1–51.
  • Vershik, A. M. and Kerov, S. V. (1977). Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tableaux. Soviet Math. Dokl. \bf18 527–531. (Translation of Dokl. Acad. Nauk SSSR \bf32 1024–1027.)