Compound Poisson approximations for word patterns under Markovian hypotheses

被引：27

作者：

Geske, MX

Godbole, AP

Schaffner, AA

Skolnick, AM

Wallstrom, GL

机构：

[1] ST NORBERT COLL, DE PERE, WI 54115 USA

[2] MICHIGAN TECHNOL UNIV, HOUGHTON, MI 49931 USA

[3] WASHINGTON UNIV, ST LOUIS, MO 63130 USA

[4] LEHIGH UNIV, BETHLEHEM, PA 18015 USA

[5] UNIV MINNESOTA, MINNEAPOLIS, MN 55455 USA

来源：

JOURNAL OF APPLIED PROBABILITY | 1995年 / 32卷 / 04期

关键词：

overlapping and non-overlapping occurrences of word patterns; Poisson and compound Poisson approximation; Stein-Chen technique; coupling; rates of convergence to stationarity;

D O I：

10.2307/3215201

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

Consider a stationary Markov chain {X(j)}(n)(j=1) with state space consisting of the xi-letter alphabet set Lambda = {a(1), a(2), a(xi)}. We study the variables M=M(n, k) and N=N(n, k), defined, respectively, as the number of overlapping and non-overlapping occurrences of a fixed periodic kappa-letter word, and use the Stein-Chen method to obtain compound Poisson approximations for their distribution.

引用

页码：877 / 892

页数：16

共 18 条

[1]

[Anonymous], ANN APPL PROBAB, DOI [DOI 10.1214/AOAP/1177005980, DOI 10.1214/aoap/1177005980]

[2] 2 MOMENTS SUFFICE FOR POISSON APPROXIMATIONS - THE CHEN-STEIN METHOD [J].