Ordered cycle lengths in a random permutation

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Let x(t) denote the number of jumps occurring in the time interval [0, t) and vk(t) = P(x(t) = k). The generating function of Vk(t) is given by exp (FORMULA PRESENTGED). Lay off to the right of the origin successive intervals of length zjjα, j = 1, 2,& Explicitly the end points are t1 = 0 (FORMULA PRESENTGED). Following Shepp and Lloyd Lr, the length of the rth longest cycle and Sr the length of the rth shortest cycle have been defined for our choice of x(t) and tj, j = 1, 2, • • •. This paper obtains the asymptotics for the mth moments of Lr and Sr suitably normalized by a new technique of generating functions. It is further shown that the results of Shepp and Lloyd are particular cases of these more general results. © 1971 Pacific Journal Of Mathematics.

Cite

CITATION STYLE

APA

Balakrishnan, V., Sankaranarayanan, G., & Suyambulingom, C. (1971). Ordered cycle lengths in a random permutation. Pacific Journal of Mathematics, 36(3), 603–613. https://doi.org/10.2140/pjm.1971.36.603

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free