When the law of large numbers fails for increasing subsequences of random permutations

When the law of large numbers fails for increasing subsequences of random permutations

Ross G. Pinsky

Source: Ann. Probab. Volume 35, Number 2 (2007), 758-772.

Abstract

Let the random variable Z_n,k denote the number of increasing subsequences of length k in a random permutation from S_n, the symmetric group of permutations of {1, …, n}. In a recent paper [Random Structures Algorithms 29 (2006) 277–295] we showed that the weak law of large numbers holds for Z_{n,k_n} if k_n=o(n^2/5); that is,

$\lim_{n\to\infty}\frac{Z_{n,k_{n}}}{EZ_{n,k_{n}}}=1\qquad \mbox{in probability}.$

The method of proof employed there used the second moment method and demonstrated that this method cannot work if the condition k_n=o(n^2/5) does not hold. It follows from results concerning the longest increasing subsequence of a random permutation that the law of large numbers cannot hold for Z_{n,k_n} if k_n≥cn^1/2, with c>2. Presumably there is a critical exponent l₀ such that the law of large numbers holds if k_n=O(n^l), with l<l₀, and does not hold if $\limsup_{n\to\infty}\frac{k_{n}}{n^{l}}>0$ , for some l>l₀. Several phase transitions concerning increasing subsequences occur at l=½, and these would suggest that l₀=½. However, in this paper, we show that the law of large numbers fails for Z_{n,k_n} if $\limsup_{n\to\infty}\frac{k_{n}}{n^{4/9}}=\infty$ . Thus, the critical exponent, if it exists, must satisfy $l_{0}\in[\frac{2}{5},\frac{4}{9}]$ .

Primary Subjects: 60F05, 60C05

Keywords: Random permutations; law of large numbers; increasing subsequences in random permutations

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.

If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.aop/1175287762
Digital Object Identifier: doi:10.1214/009117906000000728
Mathematical Reviews number (MathSciNet): MR2308596
Zentralblatt MATH identifier: 1124.60033

back to Table of Contents

References

Aldous, D. and Diaconis, P. (1999). Longest increasing subsequences: From patience sorting to the Baik--Deift--Johansson theorem. Bull. Amer. Math. Soc. (N.S.) 36 413--432.

Mathematical Reviews (MathSciNet): MR1694204

Digital Object Identifier: doi:10.1090/S0273-0979-99-00796-X

Project Euclid: euclid.bams/1183494073

Baik, J., Deift, P. and Johansson, K. (1999). On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12 1119--1178.

Mathematical Reviews (MathSciNet): MR1682248

Digital Object Identifier: doi:10.1090/S0894-0347-99-00307-0

JSTOR: links.jstor.org

Logan, B. F. and Shepp, L. A. (1977). A variational problem for random Young tableaux. Adv. Math. 26 206--222.

Mathematical Reviews (MathSciNet): MR1417317

Digital Object Identifier: doi:10.1016/0001-8708(77)90030-5

Pinsky, R. (2006). Law of large numbers for increasing subsequences of random permutations. Random Structures Algorithms 29 277--295.

Mathematical Reviews (MathSciNet): MR2254492

Vershik, A. M. and Kerov, S. V. (1985). Asymptotic behavior of the maximum and generic dimensions of irreducible representations of the symmetric group. Funct. Anal. Appl. 19 21--31.

Mathematical Reviews (MathSciNet): MR0783703

previous :: next