Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T22:49:59.199Z Has data issue: false hasContentIssue false

On Occurrences of F-S Strings in Linearly and Circularly Ordered Binary Sequences

Published online by Cambridge University Press:  14 July 2016

Frosso S. Makri*
Affiliation:
University of Patras
*
∗ Postal address: Department of Mathematics, University of Patras, 26500 Patras, Greece. Email address: makri@math.upatras.gr
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.

Consider a sequence of exchangeable or independent binary trials ordered on a line or on a circle. The statistics denoting the number of times an F-S string of length (at least)k 1 + k 2, that is, (at least)k 1 failures followed by (at least) k 2 successes in n such trials, are studied. The associated waiting time for the rth occurrence of an F-S string of length (at least) k 1 + k 2 in linearly ordered trials is also examined. Exact formulae, lower/upper bounds and approximations are derived for their distributions. Mean values and variances of the number of occurrences of F-S strings are given in exact formulae too. Particular exchangeable and independent sequences of binary random variables, used in applied research, combined with numerical examples clarify further the theoretical results.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2010