Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T06:09:30.849Z Has data issue: false hasContentIssue false

On the number of runs for Bernoulli arrays

Published online by Cambridge University Press:  14 July 2016

Djilali Ait Aoudia*
Affiliation:
Université de Sherbrooke
Éric Marchand*
Affiliation:
Université de Sherbrooke
*
∗ Current address: Département de Mathématiques et de Statistique, Université de Montréal, Montréal, QC H3C 3J7, Canada.
∗∗ Postal address: Département de Mathématiques, Université de Sherbrooke, Sherbrooke, QC J1K 2R1, Canada. Email address: eric.marchand@usherbrooke.ca
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We introduce and motivate the study of (n + 1) × r arrays X with Bernoulli entries X k,j and independently distributed rows. We study the distribution of which denotes the number of consecutive pairs of successes (or runs of length 2) when reading the array down the columns and across the rows. With the case r = 1 having been studied by several authors, and permitting some initial inferences for the general case r > 1, we examine various distributional properties and representations of S n for the case r = 2, and, using a more explicit analysis, the case of multinomial and identically distributed rows. Applications are also given in cases where the array X arises from a Pólya sampling scheme.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2010