The distribution of increasing l-sequences in random permutations: a Markov chain approach

Brad C. Johnson and James C. Fu

Statistics & Probability Letters, 2000, vol. 49, issue 4, 337-344

Abstract: This paper examines the distribution of increasing l-sequences in a random permutation generated by the integers 1,...,n; an increasing l-sequence being a sequence of l consecutive integers. The exact distribution is obtained by a finite Markov chain embedding technique in combination with a conditioning argument. The result is easy to implement, intuitively simple and can be generalized.

Keywords: Finite; Markov; chain; embedding; Sequences; Permutations; Transition; probability (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(00)00066-3
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:49:y:2000:i:4:p:337-344

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().