The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets

Ayat Al-Meanazel () and Brad C. Johnson
Additional contact information
Ayat Al-Meanazel: Al Al-bayt University
Brad C. Johnson: University of Manitoba

Methodology and Computing in Applied Probability, 2020, vol. 22, issue 3, 1009-1021

Abstract: Abstract The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets is obtained using the finite Markov chain imbedding technique (FMCI). A numerical examples are provided to aid in understanding.

Keywords: Markov chain; Impedding; Permutation; Increasing subsequence; Distribution; Arbitrary multi-sets; 60E05 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11009-019-09753-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:metcap:v:22:y:2020:i:3:d:10.1007_s11009-019-09753-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-019-09753-1

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().