The statistics of words on rings

We analyze sequences of letters on a ring. Our objective is to determine the statistics of the occurrences of a set of r‐letter words when the sequence is chosen as a periodic Markov chain of order ≤ r − 1. We first obtain a generating function for the associated probability distribution and then di...

Full description

Saved in:
Bibliographic Details
Published inCommunications on pure and applied mathematics Vol. 59; no. 1; pp. 145 - 160
Main Authors Percus, Jerome K., Percus, Ora E.
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.01.2006
Wiley
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We analyze sequences of letters on a ring. Our objective is to determine the statistics of the occurrences of a set of r‐letter words when the sequence is chosen as a periodic Markov chain of order ≤ r − 1. We first obtain a generating function for the associated probability distribution and then display its Poisson limit. For an i.i.d. letter sequence, correction terms to the Poisson limit are given. Finally, we indicate how a hidden Markov chain fits into this scheme. © 2005 Wiley Periodicals, Inc.
Bibliography:ArticleID:CPA20096
ark:/67375/WNG-1FPJRTB6-3
istex:F2DE553B9AF0E2A7E323916ADE2983375C5377F1
ISSN:0010-3640
1097-0312
DOI:10.1002/cpa.20096