HAMMERSLEYS INTERACTING PARTICLE PROCESS AND LONGEST INCREASING SUBSEQUENCES

被引：129
|
作者：
ALDOUS, D [1 ]
DIACONIS, P [1 ]
机构：
[1] HARVARD UNIV,DEPT MATH,CAMBRIDGE,MA 02138
来源：
PROBABILITY THEORY AND RELATED FIELDS | 1995年 / 103卷 / 02期
关键词：
Mathematics Subject Classification (1979): 60C05; 60K35;
D O I：
10.1007/BF01204214
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
In a famous paper [8] Hammersley investigated the length L(n) of the longest increasing subsequence of a random n-permutation. Implicit in that paper is a certain one-dimensional continuous-space interacting particle process. By studying a hydrodynamical limit for Hammersley's process we show by fairly ''soft'' arguments that lim n(-1/2)EL(n) = 2. This is a known result, but previous proofs [14, 11] relied on hard analysis of combinatorial asymptotics.
引用
收藏
页码：199 / 213
页数：15
相关论文
共 50 条
  • [31] Longest increasing subsequences in windows based on canonical antichain partition
    Chen, Erdong
    Yang, Linji
    Yuan, Hao
    THEORETICAL COMPUTER SCIENCE, 2007, 378 (03) : 223 - 236
  • [32] Longest increasing subsequences in involutions avoiding patterns of length three
    Mansour, Toufik
    Yildirim, Gokhan
    TURKISH JOURNAL OF MATHEMATICS, 2019, 43 (05) : 2183 - 2192
  • [33] Asymptotic behavior of the length of the longest increasing subsequences of random walks
    Mendonca, J. Ricardo G.
    Schawe, Hendrik
    Hartmann, Alexander K.
    PHYSICAL REVIEW E, 2020, 101 (03)
  • [34] On Longest Increasing Subsequences in Words in Which All Multiplicities are Equal
    Balogh, Ferenc
    JOURNAL OF INTEGER SEQUENCES, 2023, 26 (07)
  • [35] Longest increasing subsequences in windows based on canonical antichain partition
    Chen, ED
    Yuan, H
    Yang, LJ
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 1153 - 1162
  • [36] Empirical scaling of the length of the longest increasing subsequences of random walks
    Mendonca, J. Ricardo G.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2017, 50 (08)
  • [37] Computing Longest Increasing Subsequences over Sequential Data Streams
    Li, Youhuan
    Zou, Lei
    Zhang, Huaming
    Zhao, Dongyan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2016, 10 (03): : 181 - 192
  • [38] Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
    Hideo Bannai
    Tomohiro I.
    Tomasz Kociumaka
    Dominik Köppl
    Simon J. Puglisi
    Algorithmica, 2024, 86 : 735 - 756
  • [39] On the limiting law of the length of the longest common and increasing subsequences in random words
    Breton, Jean-Christophe
    Houdre, Christian
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2017, 127 (05) : 1676 - 1720
  • [40] Finite size corrections relating to distributions of the length of longest increasing subsequences
    Forrester, Peter J.
    Mays, Anthony
    ADVANCES IN APPLIED MATHEMATICS, 2023, 145
12345