Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-22T15:13:11.390Z Has data issue: false hasContentIssue false
  • English
  • Français

Random partial orders: concentration of the height

Published online by Cambridge University Press:  01 July 2016

B. Bollobás
B. Bollobás*
Affiliation:
University of Cambridge
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Invited Papers
Information
Advances in Applied Probability , Volume 24 , Issue 4 , December 1992 , pp. 765
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bollobás, B. and Winkler, P. M. (1988) The longest chain among random points in Euclidean space. Proc. Amer. Math. Soc. 103, 347–353.CrossRefGoogle Scholar
Frieze, A. M. (1991) On the length of the longest monotone subsequence in random permutation. Ann. Appl. Prob. 1, 301–305.CrossRefGoogle Scholar
Logan, B. F. and Shepp, L. A. (1977) A variational problem for Young tableaux. Adv. Math. 26, 206–222.CrossRefGoogle Scholar
Vershik, A. Μ. and Kerov, S. V. (1977) Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tableaux. Dokl. Akad Nauk. SSSR 233, 1024–1028.Google Scholar
Winkler, P. M. (1985) Random orders. Order 1, 317–325.CrossRefGoogle Scholar