Soft edge results for longest increasing paths on the planar lattice.
Electronic Communications in Probability [electronic only] (2010)
- Volume: 15, page 1-13
- ISSN: 1083-589X
Access Full Article
topHow to cite
topGeorgiou, Nicos. "Soft edge results for longest increasing paths on the planar lattice.." Electronic Communications in Probability [electronic only] 15 (2010): 1-13. <http://eudml.org/doc/228232>.
@article{Georgiou2010,
author = {Georgiou, Nicos},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {Bernoulli matching model; discrete TASEP; soft edge; weak law of large numbers; last passage model; increasing paths},
language = {eng},
pages = {1-13},
publisher = {University of Washington},
title = {Soft edge results for longest increasing paths on the planar lattice.},
url = {http://eudml.org/doc/228232},
volume = {15},
year = {2010},
}
TY - JOUR
AU - Georgiou, Nicos
TI - Soft edge results for longest increasing paths on the planar lattice.
JO - Electronic Communications in Probability [electronic only]
PY - 2010
PB - University of Washington
VL - 15
SP - 1
EP - 13
LA - eng
KW - Bernoulli matching model; discrete TASEP; soft edge; weak law of large numbers; last passage model; increasing paths
UR - http://eudml.org/doc/228232
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.