2012
DOI: 10.1017/s0021900200009529
|View full text |Cite
|
Sign up to set email alerts
|

Joint Distributions of Counts of Strings in Finite Bernoulli Sequences

Abstract: An infinite sequence (Y 1 , Y 2 , . . . ) of independent Bernoulli random variables with P(Y i = 1) = a/(a + b + i − 1), i = 1, 2, . . . , where a > 0 and b ≥ 0, will be called a Bern(a, b) sequence. Consider the counts Z 1 , Z 2 , Z 3 , . . . of occurrences of patterns or strings of the form {11}, {101}, {1001}, . . . , respectively, in this sequence. The joint distribution of the counts Z 1 , Z 2 , . . . in the infinite Bern(a, b) sequence has been studied extensively. The counts from the initial finite sequ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…respectively. Some relevant contributions on the subject are the works of Sarkar et al [12], Sen and Goyal [13], Holst [4], Dafnis et al [14], Huffer and Sethuraman [15], and Makri and Psillakis [16]. Applications of constrained ( , ℓ) strings of the general ( ≤ ≤ ℓ) or the restricted forms ( ≤ ℓ, = , ≥ ) were found in information theory and data compression (see Zehavi and Wolf [17], Jacquet and Szpankowski [18], and Stefanov and Szpankowski [19]) in urn models, record models, and random permutations (see Chern et al [20], Joffe et al [21], Chern and Hwang [22], Holst [5,9,10,23], and Huffer et al [24]) in system reliability (see Eryilmaz and Zuo [25], Eryilmaz and Yalcin [6], and Makri [26]) and in biomedical engineering (see Dafnis and Philippou [27]).…”
Section: Counting 0-1 Strings Of a Limited Lengthmentioning
confidence: 99%
“…respectively. Some relevant contributions on the subject are the works of Sarkar et al [12], Sen and Goyal [13], Holst [4], Dafnis et al [14], Huffer and Sethuraman [15], and Makri and Psillakis [16]. Applications of constrained ( , ℓ) strings of the general ( ≤ ≤ ℓ) or the restricted forms ( ≤ ℓ, = , ≥ ) were found in information theory and data compression (see Zehavi and Wolf [17], Jacquet and Szpankowski [18], and Stefanov and Szpankowski [19]) in urn models, record models, and random permutations (see Chern et al [20], Joffe et al [21], Chern and Hwang [22], Holst [5,9,10,23], and Huffer et al [24]) in system reliability (see Eryilmaz and Zuo [25], Eryilmaz and Yalcin [6], and Makri [26]) and in biomedical engineering (see Dafnis and Philippou [27]).…”
Section: Counting 0-1 Strings Of a Limited Lengthmentioning
confidence: 99%