Counting certain binary strings
type: Item
instance of: scholarly article
title: Counting certain binary strings
zbMATH Open document ID: 1232.62071
author: Frosso S. Makri
author: Zaharias M. Psillakis
published in: Journal of Statistical Planning and Inference
publication date: 2012-03-05T00:00:00Z
Mathematics Subject Classification ID: 62G10
Mathematics Subject Classification ID: 60G09
Mathematics Subject Classification ID: 62E15
Mathematics Subject Classification ID: 65C60
zbMATH DE Number: 6011874
zbMATH Keywords: binary trials
zbMATH Keywords: exchangeable trials
zbMATH Keywords: independent trials
zbMATH Keywords: runs
zbMATH Keywords: strings
zbMATH Keywords: waiting time
zbMATH Keywords: urn models
zbMATH Keywords: records
zbMATH Keywords: nonparametric tests of randomness
MaRDI profile type: Publication
full work available at URL: j.jspi.2011.10.015
OpenAlex ID: W2043908481
cites work: Waiting times for patterns in a sequence of multistate trials
cites work: On the distribution of the total number of run lengths
cites work: Runs and scans with applications
cites work: Q4276318
cites work: Modeling claim exceedances over thresholds.
cites work: Q4541799
cites work: Limit distribution of the number of consecutive records
cites work: Distribution of the number of consecutive records
cites work: Distributions related to \((k_{1},k_{2})\) events
cites work: Distributions of patterns of two successes separated by a string of \(k-2\) failures
cites work: Run statistics in a sequence of arbitrarily dependent binary trials
cites work: Discrete Scan Statistics Generated by Exchangeable Binary Trials
cites work: Joint distribution of run statistics in partially exchangeable processes
cites work: Q5538132
cites work: Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
cites work: A Full Likelihood Procedure for Analysing Exchangable Binary Data
cites work: Scan statistics and applications
cites work: On Ling's binomial and negative binomial distributions of order k
cites work: The central limit theorem for dependent random variables
cites work: Counts of Failure Strings in Certain Bernoulli Sequences
cites work: The Number of Two Consecutive Successes in a Hoppe-Pólya Urn
cites work: A Note on Embedding Certain Bernoulli Sequences in Marked Poisson Processes
cites work: On Consecutive Records in Certain Bernoulli Sequences
cites work: A note on records in a random sequence
cites work: Distributions of simple patterns in some kinds of exchangeable sequences
cites work: Q4122535
cites work: On a waiting time distribution in a sequence of Bernoulli trials
cites work: Runs, scans and urn model distributions: A unified Markov chain approach
cites work: Non-parametric randomness tests based on success runs of fixed length
cites work: On binomial distributions of order k
cites work: Polya Urn Models
cites work: On Occurrences of F-S Strings in Linearly and Circularly Ordered Binary Sequences
cites work: Success run statistics defined on an urn model
cites work: On runs of length exceeding a threshold: normal approximation
cites work: On success runs of length exceeded a threshold
cites work: On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results
cites work: The Distribution Theory of Runs
cites work: Q3150814
cites work: Records. Mathematical theory.
cites work: Q3408674
cites work: Waiting time distributions of runs in higher order Markov chains
DOI: 10.1016/J.JSPI.2011.10.015
Recommended article: Counting Cyclic Binary Strings
Recommended article: Q3581908
Recommended article: Q3495360
Recommended article: Computing on binary strings
Recommended article: Counting non-standard binary representations
Recommended article: Q3378265
Recommended article: Q5404314
Recommended article: Counting distinct strings
Recommended article: Counting suffix arrays and strings
description: scientific article; zbMATH DE number 6011874