The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets
The distribution theory of runs and patterns has a long and rich history. In this dissertation we study the distribution of some run-related statistics in sequences and random permutations of arbitrary multi-sets. Using the finite Markov chain imbedding technique (FMCI), which was proposed by Fu and...
Main Author: | Al-Meanazel, Ayat |
---|---|
Other Authors: | Johnson, Brad (Statistics) |
Published: |
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/1993/30872 |
Similar Items
Similar Items
-
Average length of the longest increasing subsequences in random involutions avoiding 231 and a layered pattern
by: Toufik Mansour, et al.
Published: (2020-09-01) -
Small Longest Tandem Scattered Subsequences
by: Luıs M. S. Russo, et al.
Published: (2021-08-01) -
Variations on Hammersley’s interacting particle process
by: Arda Atalik, et al.
Published: (2021-06-01) -
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?
by: Elizabeth J. Itskovich, et al.
Published: (2019-11-01) -
Using the longest run subsequence problem within homology-based scaffolding
by: Sven Schrinner, et al.
Published: (2021-06-01)