Positions of the ranks of factors in certain finite long length words
We consider the set of finite random words A⋆, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of A⋆, we consider certain factorization of the words. The factors of a word are labelled with ranks, based on the lexicographical order. In this paper we prove that the normalized position of the ranks is uniform, when the length of the word goes to infinity.
Year of publication: |
2013
|
---|---|
Authors: | Zohoorian Azad, Elahe |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 83.2013, 3, p. 836-840
|
Publisher: |
Elsevier |
Subject: | Random word | Factorized word | Rank | Permutation | Uniform distribution |
Saved in:
Saved in favorites
Similar items by subject
-
A generalized permutation approach to job shop schedulingMth genetic algorithms
Bierwirth, Christian, (1993)
-
Microdata Privacy Protection Through Permutation-Based Approaches
Zhang, Qing, (2008)
-
Automated Timetable Generation for Rounds of a Table-Tennis League
Schönberger, Jörn, (2000)
- More ...