# Tutorial on large deviations for the binomial distribution

@article{Arratia1989TutorialOL,
title={Tutorial on large deviations for the binomial distribution},
author={Richard Arratia and Louis Gordon},
journal={Bulletin of Mathematical Biology},
year={1989},
volume={51},
pages={125-131}
}
• Published 1989
• Bulletin of Mathematical Biology
We present, in an easy to use form, the large deviation theory of the binomial distribution: how to approximate the probability ofk or more successes inn independent trials, each with success probabilityp, when the specified fraction of successes,a≡k/n, satisfies 0
43 Citations
Asymptotic Tail Bound and Applications
• 2019
In the field of Computer Science, the Chernoff bound is an extremely useful found bounding the error probabilities of various algorithms. Chernoff gives an exponentially decaying upper bound on theExpand
Accurate estimates of the data complexity and success probability for various cryptanalyses
• Mathematics, Computer Science
• Des. Codes Cryptogr.
• 2011
This work provides simple formulae for estimating the data complexity and the success probability which can be applied to a lot of different scenarios (differential cryptanalysis, linear cryptanalysis), and uses a simple and general approximation of the binomial distribution and asymptotic expansions of the beta distribution. Expand
PR ] 2 1 O ct 2 01 8 A Non-asymptotic , Sharp , and User-friendly Reverse
The Chernoff-Cramèr bound is a widely used technique to analyze the upper tail bound of random variable based on its moment generating function. By elementary proofs, we develop a user-friendlyExpand
Mallows ranking models: maximum likelihood estimate and regeneration
An algorithm to select the model size of Mallows' $\phi$ model automatically is proposed, motivated by the infinite top-$t ranking model, and relies on the renewal property of such an infinite random permutation. Expand New Insights into Bootstrapping for Bandits • Computer Science, Mathematics • ArXiv • 2018 This work shows that the commonly used non-parametric bootstrapping (NPB) procedure can be provably inefficient and establishes a near-linear lower bound on the regret incurred by it under the bandit model with Bernoulli rewards, and proposes a weighted bootstrapped (WB) procedure. Expand Exploring k out of Top ρ Fraction of Arms in Stochastic Bandits • Mathematics, Computer Science • AISTATS • 2019 Results in this paper provide up to$\rho n/k$reductions compared with the $k$-exploration'' algorithms that focus on finding the (PAC) best$k$arms out of$n$arms. Expand Exponential Decay of Covariances for the Supercritical Membrane Model • Mathematics, Physics • 2016 We consider the membrane model, that is the centered Gaussian field on $${\mathbb{Z}^d}$$Zd whose covariance matrix is given by the inverse of the discrete Bilaplacian. We impose aExpand Lossless coding through the concentration of measure phenomenon • Mathematics • 2002 The lossless codication of stationary memoryless binary sources using block coding is studied with the additional constraint of requiring only two codeword lengths. The fundamental coding scheme ofExpand Modeling temporally-regulated effects on distributions We present a nonparametric framework for modeling an evolving sequence of (estimated) probability distributions which distinguishes the effects of sequential progression on the observed distributionExpand Exploring$k$out of Top$\rho$Fraction of Arms in Stochastic Bandits • Computer Science, Mathematics • 2018 Results in this paper provide up to$\rho n/k$reductions compared with the "$k-exploration" algorithms that focus on finding the (PAC) best $k$ arms out of $n$ arms. Expand