Author: T. Móri 1
View More View Less
  • 1 Eötvös Loránd University Dept. of Probability Theory and Statistics Múzeum KRT 6-8 H-1088 Budapest Hungary Múzeum KRT 6-8 H-1088 Budapest Hungary
Restricted access

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
Jun 2020 0 0 0
Jul 2020 0 0 0
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