On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads
In this paper, we study the usual coin tossing experiment. We call a run at most <i>T</i>-contaminated, if it contains at most <i>T</i> tails. We approximate the distribution of the length of the longest at most <i>T</i>-contaminated runs. We offer a more precise...
Saved in:
Main Authors: | István Fazekas, Borbála Fazekas, László Fórián |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/27/1/33 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Erdős-Révész Type Law for the Length of the Longest Match of Two Coin-Tossing Sequences
by: Karl Grill
Published: (2025-01-01) -
A continuous-time network evolution model describing $ N $-interactions
by: István Fazekas, et al.
Published: (2024-12-01) -
The Impact of Advanced Footwear Technology on the Performance and Running Biomechanics of Mountain Runners
by: Pedro Corbí-Santamaría, et al.
Published: (2025-01-01) -
Immediate and long-term effects of zero-drop running shoes on lower extremity biomechanics
by: Zimeng Liu, et al.
Published: (2025-01-01) -
ON ℐ^𝒦-CONVERGENCE OF SEQUENCES OF BI-COMPLEX NUMBERS
by: J. Hossain, et al.
Published: (2024-10-01)