Moderate Deviations for Longest Increasing Subsequences: The Lower Tail

被引:0
|
作者
Matthias Löwe
Franz Merkl
Silke Rolles
机构
[1] University of Nijmegen,Department of Mathematics
[2] Universität Bielefeld,Fakultät für Mathematik
[3] University of California,Department of Mathematics
来源
关键词
Ulam's problem; random permutations; moderate deviations; Poissonization;
D O I
暂无
中图分类号
学科分类号
摘要
We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity.
引用
收藏
页码:1031 / 1047
页数:16
相关论文
共 50 条
  • [21] HAMMERSLEYS INTERACTING PARTICLE PROCESS AND LONGEST INCREASING SUBSEQUENCES
    ALDOUS, D
    DIACONIS, P
    PROBABILITY THEORY AND RELATED FIELDS, 1995, 103 (02) : 199 - 213
  • [22] Finding longest increasing and common subsequences in streaming data
    David Liben-Nowell
    Erik Vee
    An Zhu
    Journal of Combinatorial Optimization, 2006, 11 : 155 - 175
  • [23] 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
  • [24] 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
  • [25] 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
  • [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