ON THE LENGTH OF THE LONGEST MONOTONE SUBSEQUENCE IN A RANDOM PERMUTATION by

@inproceedings{Frieze1997ONTL,
  title={ON THE LENGTH OF THE LONGEST MONOTONE SUBSEQUENCE IN A RANDOM PERMUTATION by},
  author={Frieze},
  year={1997}
}
In this short note we prove a concentration result for the length L n of the longest monotone increasing subsequence of a random permutation of the set but less is known about the concentration of L n around its mean. Our aim here is to prove the following. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Sharp concentration of measure phenomena in random graphs , to appear Probability inequalities for sums of bounded random variables

  • B. F. Logan, L. A. Shepp
  • Journal of the American Statistical Association

Similar Papers

Loading similar papers…