Useful inequalities for the longest run distribution (Q1970812): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q388926 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Andrew David Barbour / rank | |||
Normal rank | |||
Revision as of 01:42, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Useful inequalities for the longest run distribution |
scientific article |
Statements
Useful inequalities for the longest run distribution (English)
0 references
21 March 2000
0 references
The author proves a simple and explicit lower bound for the probability that the longest success run in a sequence of \(n\) Bernoulli trials is less than a given length \(k\). The arguments used are analytic and combinatorial in nature. The lower bound is usually better than those obtained using compound Poisson approximation and Stein's method. See also \textit{S. Yu. Novak} [Theory Probab. Appl. 39, No. 4, 593-603 (1994); translation from Teor. Veroyatn. Primen. 39, No. 4, 731-742 (1994; Zbl 0847.60016)].
0 references
longest success run
0 references
Bernoulli trials
0 references
compound Poisson approximation
0 references
Stein's method
0 references
