Imagen de Portada

A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Segert, Simon
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The generalized Alice HH vs Bob HT problem
por: Janson, Svante, et al.
Publicado: (2025)

How to Answer Questions of the Type: If you toss a coin n times, how likely is HH to show up more than HT?
por: Ekhad, Shalosh B., et al.
Publicado: (2024)

Moments for generalizations of a coin flip game
por: Huang, Jia
Publicado: (2026)

Self-avoiding walk is ballistic on graphs with more than one end
por: Lehner, Florian, et al.
Publicado: (2024)

On maximizing the number of heads when you need to set aside at least one coin every round
por: van Doorn, Wouter
Publicado: (2024)

An information-theoretic proof of a hypercontractive inequality
por: Friedgut, Ehud
Publicado: (2015)

An elementary proof of the bunkbed conjecture for forests
por: Donderwinkel, Serte, et al.
Publicado: (2025)

How many coin tosses would you need until you get $n$ Heads or $m$ Tails?
por: Janson, Svante, et al.
Publicado: (2025)

Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
por: Kwan, Matthew, et al.
Publicado: (2022)

Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs $G(n,m)$ and $G(n,p)$
por: Alvarado, José D., et al.
Publicado: (2023)

Characterization of flip process rules with the same trajectories
por: Hng, Eng Keat
Publicado: (2023)

Moderate Deviations of Triangle Counts in the Erdős-Rényi Random Graph $G(n,m)$: The Lower Tail
por: Alvarado, José, et al.
Publicado: (2024)

A proof of the Erdős primitive set conjecture
por: Lichtman, Jared Duker
Publicado: (2022)

${\mathrm{ASL}_n}(\mathbb Z)$ invariant random subsets of $\mathbb Z^n$
por: Frączyk, Mikołaj, et al.
Publicado: (2026)

Randomized algorithms to generate hypergraphs with given degree sequences
por: Ascolese, Michela, et al.
Publicado: (2024)

Persistence probabilities for MA(1) sequences with uniform innovations
por: Aurzada, Frank, et al.
Publicado: (2025)

Counting graphic sequences via integrated random walks
por: Balister, Paul, et al.
Publicado: (2023)

Lonely passengers: a short proof
por: Haslegrave, John
Publicado: (2025)

Prominent examples of flip processes
por: Araújo, Pedro, et al.
Publicado: (2022)

To stay discovered: On tournament mean score sequences and the Bradley--Terry model
por: Aldous, David, et al.
Publicado: (2018)

Short proofs in combinatorics, probability and number theory II
por: Alexeev, Boris, et al.
Publicado: (2026)

Rapid mixing of the flip chain over non-crossing spanning trees
por: Anand, Konrad, et al.
Publicado: (2024)

Persistence probabilities of MA(1) sequences with Laplace innovations and $q$-deformed zigzag numbers
por: Aurzada, Frank, et al.
Publicado: (2025)

Probabilistic $(m,n)$-Parking Functions
por: Harris, Pamela E., et al.
Publicado: (2025)

Tight Asymptotic of Probability of singularity of n x n Random Matrix with Uniform Distributed \pm 1 Entries
por: Blinovsky, Vladimir
Publicado: (2015)

Asymptotics of the partial $n$-fold dimer model
por: Meng, Christina
Publicado: (2024)

From flip processes to dynamical systems on graphons
por: Garbe, Frederik, et al.
Publicado: (2022)

Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
por: Balister, Paul, et al.
Publicado: (2022)

Clique packings in random graphs
por: Griffiths, Simon, et al.
Publicado: (2024)

Patterns in sequences
por: Kenyon, Richard
Publicado: (2026)

A coin flip game and generalizations of Fibonacci numbers
por: Huang, Jia
Publicado: (2025)

Fluctuations in the Aztec diamonds via a space-like maximal surface in Minkowski 3-space
por: Chelkak, Dmitry, et al.
Publicado: (2020)

Random subsets of Cantor sets generated by trees of coin flips
por: Allaart, Pieter, et al.
Publicado: (2023)

A central limit theorem for the matching number of a sparse random graph
por: Glasgow, Margalit, et al.
Publicado: (2024)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
por: Balister, Paul, et al.
Publicado: (2025)

A short proof of a central limit theorem for the order of the giant component and $k$-core
por: Anastos, Michael, et al.
Publicado: (2025)

On the $H$-space of a random graph
por: Dubroff, Quentin, et al.
Publicado: (2024)

The Moran process on a random graph
por: Frieze, Alan, et al.
Publicado: (2024)

Transitive closure in a polluted environment
por: Gravner, Janko, et al.
Publicado: (2019)

A Resolution of the McCarty Conjecture
por: Godbole, Anant, et al.
Publicado: (2025)