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 条
  • [21] Finding longest increasing and common subsequences in streaming data
    David Liben-Nowell
    Erik Vee
    An Zhu
    Journal of Combinatorial Optimization, 2006, 11 : 155 - 175
  • [22] An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences
    Lin, Chun
    Huang, Chao-Yuan
    Tsai, Ming-Jer
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 25 - 36
  • [23] Faster algorithms for computing longest common increasing subsequences
    Stolting Brodal, Gerth
    Kaligosi, Kanela
    Katriel, Irit
    Kutz, Martin
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 330 - 341
  • [24] Finding a Reconfiguration Sequence between Longest Increasing Subsequences
    Aoike, Yuuki
    Kiyomi, Masashi
    Kobayashi, Yasuaki
    Otachi, Yota
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2024, E107D (04) : 559 - 563
  • [25] Moderate deviations for longest increasing subsequences:: The lower tail
    Löwe, M
    Merkl, F
    Rolles, S
    JOURNAL OF THEORETICAL PROBABILITY, 2002, 15 (04) : 1031 - 1047
  • [26] Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
    Bannai, Hideo
    Tomohiro, I
    Kociumaka, Tomasz
    Koeppl, Dominik
    Puglisi, Simon J.
    ALGORITHMICA, 2024, 86 (03) : 735 - 756
  • [27] ASYMPTOTIC EXPANSIONS RELATING TO THE DISTRIBUTION OF THE LENGTH OF LONGEST INCREASING SUBSEQUENCES
    Bornemann, Folkmar
    arXiv, 2023,
  • [28] The Communication and Streaming Complexity of Computing the Longest Common and Increasing Subsequences
    Sun, Xiaoming
    Woodruff, David P.
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 336 - +
  • [29] Unique longest increasing subsequences in 132-avoiding permutations
    Van Nimwegen, Nicholas
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2024, 89 : 397 - 399
  • [30] Asymptotic expansions relating to the distribution of the length of longest increasing subsequences
    Bornemann, Folkmar
    FORUM OF MATHEMATICS SIGMA, 2024, 12
12345