Abstract
For everyk≥1 consider the waiting time until each pattern of lengthk over a fixed alphabet of sizen appears at least once in an infinite sequence of independent, uniformly distributed random letters. Lettingn→∞ we determine the limiting finite dimensional joint distributions of these waiting times after suitable normalization and provide an estimate for the rate of convergence. It will turn out that these waiting times are getting independent.
Monthly Content Usage
| Abstract Views | Full Text Views | PDF Downloads | |
|---|---|---|---|
| Aug 2020 | 1 | 0 | 0 |
| Sep 2020 | 0 | 0 | 0 |
| Oct 2020 | 0 | 0 | 0 |
| Nov 2020 | 0 | 0 | 0 |
| Dec 2020 | 0 | 0 | 0 |
| Jan 2021 | 0 | 0 | 0 |
| Feb 2021 | 0 | 0 | 0 |
Copyright Akadémiai Kiadó
AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Copyright Akadémiai Kiadó AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Powered by PubFactory