Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence
From MaRDI portal
Publication:6113511
DOI10.1007/s10114-023-1355-zzbMath1520.60019arXiv2009.08678OpenAlexW4366824309MaRDI QIDQ6113511
Publication date: 9 August 2023
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.08678
Probability distributions: general theory (60E05) Strong limit theorems (60F15) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general large deviation principle for longest runs
- On the number of switches in unbiased coin-tossing
- Tight bounds and approximations for scan statistic probabilities for discrete data
- On the length of the longest run in a multi-state Markov chain.
- A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis
- Longest runs in coin tossing
- Useful inequalities for the longest run distribution
- Large deviation behavior for the longest head run in an IID Bernoulli sequence
- On the length of the longest head run
- On a new law of large numbers
- Optimal One-Dimensional Coverage by Unreliable Sensors
- Higher-order dangers and precisely constructed taxa in models of randomness
- The Longest Run of Heads
- On the Length of the Longest Head-Run for a Markov Chain with Two States
- Asymptotic Convergence Rates of the Length of the Longest Run(s) in an Inflating Bernoulli Net
- On the length of the longest consecutive switches
- Long hitting times for expanding systems
This page was built for publication: Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence