An Erdős-Révész Type Law for the Length of the Longest Match of Two Coin-Tossing Sequences
Consider a coin-tossing sequence, i.e., a sequence of independent variables, taking values 0 and 1 with probability <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn><mo>/</mo&...
Saved in:
Main Author: | Karl Grill |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/27/1/34 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads
by: István Fazekas, et al.
Published: (2025-01-01) -
An LSH Based Time Subsequence Matching Algorithm
by: Genping Liu, et al.
Published: (2015-08-01) -
On the Komlós–Révész SLLN for Ψ-Mixing Sequences
by: Zbigniew S. Szewczak
Published: (2025-01-01) -
A Deep Learning Framework for the Classification of Brazilian Coins
by: Debabrata Swain, et al.
Published: (2023-01-01) -
Detection method of mixed coin transaction based on CoinJoin——take the Wasabi platform as an example
by: Hu LI, et al.
Published: (2023-12-01)