Soft edge results for longest increasing paths on the planar lattice

Georgiou, Nicos (2010) Soft edge results for longest increasing paths on the planar lattice. Electronic Communications in Probability, 15. pp. 1-13. ISSN 1083-589X

[img] PDF - Published Version
Restricted to SRO admin only

Download (201kB)

Abstract

For two-dimensional last-passage time models of weakly increasing paths, interesting scaling limits have been proved for points close the axis (the hard edge). For strictly increasing paths of Bernoulli(p) marked sites, the relevant boundary is the line y = px. We call this the soft edge to contrast it with the hard edge. We prove laws of large numbers for the maximal cardinality of a strictly increasing path in the rectangle [bp−1n− xnac]×[n] as the parameters a and x vary. The results change qualitatively as a passes through the value 1/2.

Item Type: Article
Schools and Departments: School of Mathematical and Physical Sciences > Mathematics
Subjects: Q Science > QA Mathematics
Depositing User: Richard Chambers
Date Deposited: 08 Nov 2013 12:58
Last Modified: 07 Mar 2017 04:40
URI: http://sro.sussex.ac.uk/id/eprint/46972

View download statistics for this item

📧 Request an update