# 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
• Mathematics
• 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
33 Citations

### Asymptotic Tail Bound and Applications

• Computer Science
• 2019
This project will explore and derive multiple upper and lower bounds for Chernoff using methods ranging from geometric series and generating functions to saddlepoint approximations and laplace approximation, and use the formulas to answer whether algorithms exists for the following problems.

### 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.

### PR ] 2 1 O ct 2 01 8 A Non-asymptotic , Sharp , and User-friendly Reverse

A user-friendly reverse Chernoff-Cramèr bound is developed that yields non-asymptotic lower tail bounds for generic random variables and is applied to develop matching upper and lower bounds for extreme value expectation of the sum of independent subGaussian and sub-exponential random variables.

### Exploring k out of Top ρ Fraction of Arms in Stochastic Bandits

• 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.

### Lossless coding through the concentration of measure phenomenon

• Computer Science
• 2002
It is shown that the average codeword length per source output for such block codes converges to the binary entropy at a rate slower than O n 1=2 .

### 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 distribution

### Exploring $k$ out of Top $\rho$ Fraction of Arms in Stochastic Bandits

• Computer Science
• 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.

### Payoff equivalence of efficient mechanisms in large matching markets

We study Pareto efficient mechanisms in matching markets when the number of agents is large and individual preferences are randomly drawn from a class of distributions, allowing for both common and

### Analysis of Non-Orthogonal Sequences for Grant-Free RA With Massive MIMO

• Computer Science
IEEE Transactions on Communications
• 2020
It is shown that there exists an optimal number of ZC roots that maximizes the success probability for mGFRA, which is low-bounded by orthogonal baseline, and Gaussian distribution sequences outperform Gaussian ones.